default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMirjana Cangalovic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j15]Dragos M. Cvetkovic, Mirjana Cangalovic, Zorica Drazic
, Vera Kovacevic-Vujcic:
Complexity indices for the traveling salesman problem based on short edge subgraphs. Central Eur. J. Oper. Res. 26(3): 759-769 (2018)- 2017
- [j14]Nebojsa Nikolic, Mirjana Cangalovic, Igor Grujicic:
Symmetry properties of resolving sets and metric bases in hypercubes. Optim. Lett. 11(6): 1057-1067 (2017) - [j13]Lena S. Dordevic, Slobodan Antic, Mirjana Cangalovic, Andrej Lisec:
A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints. Optim. Lett. 11(6): 1137-1154 (2017) - [j12]Zorica Drazic, Mirjana Cangalovic, Vera Kovacevic-Vujcic:
A metaheuristic approach to the dominating tree problem. Optim. Lett. 11(6): 1155-1167 (2017) - 2012
- [j11]Jozef Kratica, Vera Kovacevic-Vujcic, Mirjana Cangalovic, Milica Stojanovic:
Minimal doubly resolving sets and the strong metric dimension of some convex polytopes. Appl. Math. Comput. 218(19): 9790-9801 (2012) - [j10]Nenad Mladenovic, Jozef Kratica, Vera Kovacevic-Vujcic, Mirjana Cangalovic:
Variable neighborhood search for the strong metric dimension problem. Electron. Notes Discret. Math. 39: 51-57 (2012) - [j9]Nenad Mladenovic, Jozef Kratica, Vera Kovacevic-Vujcic, Mirjana Cangalovic:
Variable neighborhood search for metric dimension and minimal doubly resolving set problems. Eur. J. Oper. Res. 220(2): 328-337 (2012) - 2010
- [j8]Mathieu Bouchard, Mirjana Cangalovic, Alain Hertz:
On a reduction of the interval coloring problem to a series of bandwidth coloring problems. J. Sched. 13(6): 583-595 (2010)
2000 – 2009
- 2009
- [j7]Jozef Kratica, Vera Kovacevic-Vujcic, Mirjana Cangalovic:
Computing the metric dimension of graphs by genetic algorithms. Comput. Optim. Appl. 44(2): 343-361 (2009) - [j6]Jozef Kratica, Mirjana Cangalovic, Vera Kovacevic-Vujcic:
Computing minimal doubly resolving sets of graphs. Comput. Oper. Res. 36(7): 2149-2159 (2009) - [j5]Mathieu Bouchard, Mirjana Cangalovic, Alain Hertz:
About equivalent interval colorings of weighted graphs. Discret. Appl. Math. 157(17): 3615-3624 (2009) - 2008
- [j4]Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vujcic, Mirjana Cangalovic:
General variable neighborhood search for the continuous optimization. Eur. J. Oper. Res. 191(3): 753-770 (2008) - 2003
- [j3]Nenad Mladenovic, J. Petrovic, Vera Kovacevic-Vujcic, Mirjana Cangalovic:
Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. Eur. J. Oper. Res. 151(2): 389-399 (2003)
1990 – 1999
- 1999
- [c1]Dragos M. Cvetkovic, Mirjana Cangalovic, Vera Kovacevic-Vujcic:
Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem. IPCO 1999: 126-136 - 1998
- [j2]Mirjana Cangalovic, Vera Kovacevic-Vujcic, Lav Ivanovic, Milan Drazic:
Modeling and solving a real-life assignment problem at universities. Eur. J. Oper. Res. 110(2): 223-233 (1998) - 1992
- [j1]Mirjana Cangalovic, Jan A. M. Schreuder:
Modelling and solving an acyclic multi-period timetabling problem. Discret. Appl. Math. 35(3): 177-195 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
