{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T14:15:31Z","timestamp":1715955331116},"reference-count":43,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","doi-asserted-by":"publisher","award":["174010","174033"],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1016\/j.ejor.2012.02.019","type":"journal-article","created":{"date-parts":[[2012,2,21]],"date-time":"2012-02-21T06:05:33Z","timestamp":1329804333000},"page":"328-337","source":"Crossref","is-referenced-by-count":26,"title":["Variable neighborhood search for metric dimension and minimal doubly resolving set problems"],"prefix":"10.1016","volume":"220","author":[{"given":"Nenad","family":"Mladenovi\u0107","sequence":"first","affiliation":[]},{"given":"Jozef","family":"Kratica","sequence":"additional","affiliation":[]},{"given":"Vera","family":"Kova\u010devi\u0107-Vuj\u010di\u0107","sequence":"additional","affiliation":[]},{"given":"Mirjana","family":"\u010cangalovi\u0107","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2012.02.019_b0005","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1112\/blms\/bdq096","article-title":"Base size, metric dimension and other invariants of groups and graphs","volume":"43","author":"Bailey","year":"2011","journal-title":"Bulletin of the London Mathematical Society"},{"key":"10.1016\/j.ejor.2012.02.019_b0010","doi-asserted-by":"crossref","unstructured":"Bailey, R., & Meagher, K., 2011. On the metric dimension of Grassmann graphs. Technical Report. arXiv:1010.4495.","DOI":"10.46298\/dmtcs.532"},{"key":"10.1016\/j.ejor.2012.02.019_b0015","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"Or-library: distributing test problems by electronic mail","volume":"41","author":"Beasley","year":"1990","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2012.02.019_b0020","doi-asserted-by":"crossref","first-page":"2168","DOI":"10.1109\/JSAC.2006.884015","article-title":"Network discovery and verification","volume":"24","author":"Beerliova","year":"2006","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10.1016\/j.ejor.2012.02.019_b0025","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/050641867","article-title":"On the metric dimension of cartesian products of graphs","volume":"21","author":"C\u00e1ceres","year":"2007","journal-title":"SIAM Journal in Discrete Mathematics"},{"key":"10.1016\/j.ejor.2012.02.019_b0030","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.endm.2009.11.004","article-title":"On the metric dimension of infinite graphs","volume":"35","author":"C\u00e1ceres","year":"2009","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"10.1016\/j.ejor.2012.02.019_b0035","first-page":"349","article-title":"Bounds on the metric and partition dimensions of a graph","volume":"88","author":"Chappell","year":"2008","journal-title":"Ars Combinatoria"},{"key":"10.1016\/j.ejor.2012.02.019_b0040","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","article-title":"Resolvability in graphs and the metric dimension of a graph","volume":"105","author":"Chartrand","year":"2000","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2012.02.019_b0045","first-page":"157","article-title":"The metric dimension and metric independence of a graph","volume":"39","author":"Currie","year":"2001","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"10.1016\/j.ejor.2012.02.019_b0050","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1142\/S021759590500056X","article-title":"Permutation based genetic, tabu and variable neighborhood search heuristics for multiprocessor scheduling with communication delays","volume":"22","author":"Davidovic","year":"2005","journal-title":"Asia\u2013Pacific Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.019_b0055","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.disc.2005.09.015","article-title":"The metric dimension of Cayley digraphs","volume":"306","author":"Fehr","year":"2006","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.ejor.2012.02.019_b0060","doi-asserted-by":"crossref","unstructured":"Garcia, S., Labbe, M., & Marin, A., in press. Solving large p-median problems with a radius formulation. Informs Journal on Computing. doi:10.1287\/ijoc.1100.0418.","DOI":"10.1287\/ijoc.1100.0418"},{"key":"10.1016\/j.ejor.2012.02.019_b0065","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10288-008-0089-1","article-title":"Variable neighbourhood search: methods and applications (invited survey)","volume":"6","author":"Hansen","year":"2008","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"key":"10.1016\/j.ejor.2012.02.019_b0070","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","article-title":"Variable neighbourhood search: algorithms and applications","volume":"175","author":"Hansen","year":"2010","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2012.02.019_b0075","first-page":"191","article-title":"On the metric dimension of a graph","volume":"2","author":"Harary","year":"1976","journal-title":"Ars Combinatoria"},{"key":"10.1016\/j.ejor.2012.02.019_b0080","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/978-3-642-19222-7_15","article-title":"On approximation complexity of metric dimension problem","volume":"6460","author":"Hauptmann","year":"2011","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/j.ejor.2012.02.019_b0085","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.endm.2005.06.023","article-title":"On the metric dimension of some families of graphs","volume":"22","author":"Hernando","year":"2005","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"10.1016\/j.ejor.2012.02.019_b0090","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.endm.2007.07.058","article-title":"Extremal graph theory for metric dimension and diameter","volume":"29","author":"Hernando","year":"2007","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"10.1016\/j.ejor.2012.02.019_b0095","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/302","article-title":"Extremal graph theory for metric dimension and diameter","volume":"17","author":"Hernando","year":"2010","journal-title":"Electronic Journal of Combinatorics"},{"key":"10.1016\/j.ejor.2012.02.019_b0100","first-page":"111","article-title":"A subfamily of a generalized petersen graph p(n,3) with constant metric dimension","volume":"81","author":"Husnine","year":"2010","journal-title":"Utilitas Mathematica"},{"key":"10.1016\/j.ejor.2012.02.019_b0105","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ejor.2010.02.022","article-title":"A general variable neighborhood search for solving the uncapacitated single allocation p-Hub median problem","volume":"206","author":"Ili\u0107","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.019_b0110","doi-asserted-by":"crossref","first-page":"2629","DOI":"10.1016\/j.camwa.2010.08.090","article-title":"On families of convex polytopes with constant metric dimension","volume":"60","author":"Imran","year":"2010","journal-title":"Computers and Mathematics with Applications"},{"key":"10.1016\/j.ejor.2012.02.019_b0115","first-page":"21","article-title":"Families of regular graphs with constant metric dimension","volume":"75","author":"Javaid","year":"2008","journal-title":"Utilitas Mathematica"},{"key":"10.1016\/j.ejor.2012.02.019_b0120","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","article-title":"Landmarks in graphs","volume":"70","author":"Khuller","year":"1996","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2012.02.019_b0125","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2298\/YJOR0801001K","article-title":"Formulation space search approach for the teacher\/class timetabling problem","volume":"18","author":"Kochetov","year":"2008","journal-title":"Yugoslav Journal of Operations Research"},{"key":"10.1016\/j.ejor.2012.02.019_b0130","doi-asserted-by":"crossref","first-page":"143","DOI":"10.2298\/YJOR0802143K","article-title":"Computing strong metric dimension of some special classes of graphs by genetic algorithms","volume":"18","author":"Kratica","year":"2008","journal-title":"Yugoslav Journal of Operations Research"},{"key":"10.1016\/j.ejor.2012.02.019_b0135","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10589-007-9154-5","article-title":"Computing the metric dimension of graphs by genetic algorithms","volume":"44","author":"Kratica","year":"2009","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/j.ejor.2012.02.019_b0140","doi-asserted-by":"crossref","first-page":"2149","DOI":"10.1016\/j.cor.2008.08.002","article-title":"Computing minimal doubly resolving sets of graphs","volume":"36","author":"Kratica","year":"2009","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2012.02.019_b0145","doi-asserted-by":"crossref","unstructured":"Mansini, R., Labadie, N., Melechovsk\u00fd, J., & Calvo, R., in press. The team orienteering problem with time windows: an LP-based granular variable neighborhood search. European Journal of Operational Research. doi:10.1016\/j.ejor.2012.01.030.","DOI":"10.1016\/j.ejor.2012.01.030"},{"key":"10.1016\/j.ejor.2012.02.019_b0150","first-page":"501","article-title":"Minimum metric dimension of silicate networks","volume":"98","author":"Manuel","year":"2011","journal-title":"Ars Combinatoria"},{"key":"10.1016\/j.ejor.2012.02.019_b0155","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighbourhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2012.02.019_b0160","doi-asserted-by":"crossref","first-page":"2419","DOI":"10.1016\/j.cor.2004.03.010","article-title":"Reformulation descent applied to circle packing problems","volume":"32","author":"Mladenovi\u0107","year":"2005","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2012.02.019_b0165","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/978-3-540-74446-7_20","article-title":"Formulation space search for circle packing problems","volume":"4638","author":"Mladenovi\u0107","year":"2007","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/j.ejor.2012.02.019_b0170","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.ejor.2008.12.015","article-title":"Variable neighbourhood search for bandwidth reduction","volume":"200","author":"Mladenovi\u0107","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.019_b0175","doi-asserted-by":"crossref","unstructured":"Mladenovi\u0107, N., Uro\u0161evi\u0107, D., Hanafi, S., & Ili\u0107, A., in press. A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. European Journal of Operational Research. doi:10.1016\/j.ejor.2012.01.036.","DOI":"10.1016\/j.ejor.2012.01.036"},{"key":"10.1016\/j.ejor.2012.02.019_b0180","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/j.ejor.2011.11.036","article-title":"A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times","volume":"218","author":"Muller","year":"2012","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.019_b0185","first-page":"33","article-title":"The metric dimension of cartesian products of graphs","volume":"69","author":"Peters-Fransen","year":"2006","journal-title":"Utilitas Mathematica"},{"key":"10.1016\/j.ejor.2012.02.019_b0190","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/978-3-642-19867-0_10","article-title":"Metric bases for polyhedral gauges","volume":"6607","author":"Rebatel","year":"2011","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/j.ejor.2012.02.019_b0195","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/moor.1030.0070","article-title":"On metric generators of graphs","volume":"29","author":"Sebo","year":"2004","journal-title":"Mathematics & Operations Research"},{"key":"10.1016\/j.ejor.2012.02.019_b0200","first-page":"549","article-title":"Leaves of trees","volume":"14","author":"Slater","year":"1975","journal-title":"Congressus Numerantium"},{"key":"10.1016\/j.ejor.2012.02.019_b0205","first-page":"621","article-title":"Graphs with metric dimension two \u2013 a characterization","volume":"60","author":"Sudhakara","year":"2009","journal-title":"World Academy of Science, Engineering and Technology"},{"key":"10.1016\/j.ejor.2012.02.019_b0210","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.ejor.2011.04.015","article-title":"A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems","volume":"214","author":"Xiao","year":"2012","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.019_b0215","doi-asserted-by":"crossref","first-page":"2793","DOI":"10.1016\/j.camwa.2011.03.046","article-title":"On the metric dimension of corona product graphs","volume":"61","author":"Yero","year":"2011","journal-title":"Computers and Mathematics with Applications"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712001361?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712001361?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T10:53:39Z","timestamp":1656586419000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221712001361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["S0377221712001361"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2012.02.019","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}