{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T14:12:54Z","timestamp":1773583974024,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,12,4]],"date-time":"2007-12-04T00:00:00Z","timestamp":1196726400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s10589-007-9154-5","type":"journal-article","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T11:48:42Z","timestamp":1196682522000},"page":"343-361","source":"Crossref","is-referenced-by-count":26,"title":["Computing the metric dimension of graphs by genetic algorithms"],"prefix":"10.1007","volume":"44","author":[{"given":"Jozef","family":"Kratica","sequence":"first","affiliation":[]},{"given":"Vera","family":"Kova\u010devi\u0107-Vuj\u010di\u0107","sequence":"additional","affiliation":[]},{"given":"Mirjana","family":"\u010cangalovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,12,4]]},"reference":[{"key":"9154_CR1","doi-asserted-by":"crossref","DOI":"10.1887\/0750306645","volume-title":"Evolutionary Computation 1: Basic Algorithms and Operators","author":"T. B\u00e4ck","year":"2000","unstructured":"B\u00e4ck, T., Fogel, D.B., Michalewicz, Z.: Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing, Bristol (2000)"},{"key":"9154_CR2","doi-asserted-by":"crossref","DOI":"10.1201\/9781420034349","volume-title":"Evolutionary Computation 2: Advanced Algorithms and Operators","author":"T. B\u00e4ck","year":"2000","unstructured":"B\u00e4ck, T., Fogel, D.B., Michalewicz, Z.: Evolutionary Computation 2: Advanced Algorithms and Operators. Institute of Physics Publishing, Bristol (2000)"},{"key":"9154_CR3","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF02404002","volume":"8","author":"J.E. Beasley","year":"1996","unstructured":"Beasley, J.E.: Obtaining test problems via internet. J. Glob. Optim. 8, 429\u2013433 (1996). http:\/\/www.brunel.ac.uk\/depts\/ma\/research\/jeb\/orlib","journal-title":"J. Glob. Optim."},{"key":"9154_CR4","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/0377-2217(95)00093-3","volume":"94","author":"J.E. Beasley","year":"1996","unstructured":"Beasley, J.E., Cao, B.: A tree search algorithm for the crew scheduling problem. Eur. J. Oper. Res. 94, 517\u2013526 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9154_CR5","doi-asserted-by":"crossref","unstructured":"C\u00e1ceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.L., Seara, C.: On the metric dimension of some families of graphs. In: Proc. 7th Internacional Colloquium on Graph Theory\u2014ICGT\u201905, Hy\u00e8res, France (2005)","DOI":"10.1016\/j.endm.2005.06.023"},{"key":"9154_CR6","unstructured":"C\u00e1ceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.L., Seara, C., Wood, D.R.: On the metric dimension of graph products. In: Proc. 20th British Combinatorial Conference, Durham, England (2005)"},{"issue":"2","key":"9154_CR7","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/050641867","volume":"21","author":"J. C\u00e1ceres","year":"2007","unstructured":"C\u00e1ceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.L., Seara, C., Wood, D.R.: On the metric dimension of Cartesian products of graphs. SIAM J. Discrete Math. 21(2), 423\u2013441 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"9154_CR8","unstructured":"Chappell, G.G., Gimbel, J., Hartman, C.: Bounds on the metric and partition dimensions of a graph. Manuscript (2003)"},{"key":"9154_CR9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0166-218X(00)00198-0","volume":"105","author":"G. Chartrand","year":"2000","unstructured":"Chartrand, G., Eroha, L., Johnson, M.A., Oellermann, O.R.: Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. 105, 99\u2013113 (2000)","journal-title":"Discrete Appl. Math."},{"key":"9154_CR10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0898-1221(00)00126-7","volume":"39","author":"G. Chartrand","year":"2000","unstructured":"Chartrand, G., Poisson, C., Zhang, P.: Resolvability and the upper dimension of graphs. Comput. Math. Appl. 39, 19\u201328 (2000)","journal-title":"Comput. Math. Appl."},{"key":"9154_CR11","first-page":"157","volume":"39","author":"J.D. Currie","year":"2001","unstructured":"Currie, J.D., Oellerman, O.R.: The metric dimension and metric independence of a graph. J. Comb. Math. Comb. Comput. 39, 157\u2013167 (2001)","journal-title":"J. Comb. Math. Comb. Comput."},{"issue":"2","key":"9154_CR12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.2298\/YJOR0402147C","volume":"14","author":"D. Cvetkovi\u0107","year":"2004","unstructured":"Cvetkovi\u0107, D., Hansen, P., Kova\u010devi\u0107-Vuj\u010di\u0107, V.: On some interconnections between combinatorial optimization and extremal graph theory. Yugosl. J. Oper. Res. 14(2), 147\u2013154 (2004)","journal-title":"Yugosl. J. Oper. Res."},{"key":"9154_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"issue":"1","key":"9154_CR14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.disc.2005.09.015","volume":"306","author":"M. Fehr","year":"2006","unstructured":"Fehr, M., Gosselin, S., Oellermann, O.R.: The metric dimension of Cayley digraphs. Discrete Math. 306(1), 31\u201341 (2006)","journal-title":"Discrete Math."},{"key":"9154_CR15","first-page":"143","volume":"22","author":"V. Filipovi\u0107","year":"2003","unstructured":"Filipovi\u0107, V.: Fine-grained tournament selection operator in genetic algorithms. Comput. Inform. 22, 143\u2013161 (2003)","journal-title":"Comput. Inform."},{"key":"9154_CR16","unstructured":"Filipovi\u0107, V.: Selection and migration operators and Web services in parallel evolutionary algorithms. Ph.D. thesis, Faculty of Mathematics, University of Belgrade (2006) (in Serbian)"},{"key":"9154_CR17","unstructured":"Filipovi\u0107, V., Kratica, J., To\u0161i\u0107, D., Ljubi\u0107, I.: Fine grained tournament selection for the simple plant location problem. In: Proceedings of the 5th Online World Conference on Soft Computing Methods in Industrial Applications\u2014WSC5, pp.\u00a0152\u2013158 (2000)"},{"key":"9154_CR18","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"Fleurent, C., Ferland, J.A.: Genetic and hybrid algorithms for graph coloring. Ann. Oper. Res. 63, 437\u2013461 (1996)","journal-title":"Ann. Oper. Res."},{"key":"9154_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, F.: Tabu Search. Kluwer Academic, Norwell (1997)"},{"issue":"3","key":"9154_CR20","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9154_CR21","first-page":"191","volume":"2","author":"F. Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Comb. 2, 191\u2013195 (1976)","journal-title":"Ars Comb."},{"key":"9154_CR22","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0377-2217(02)00823-8","volume":"151","author":"A. Hertz","year":"2003","unstructured":"Hertz, A., Widmer, M.: Guidelines for the use of meta-heuristics in combinatorial optimization. Eur. J. Oper. Res. 151, 247\u2013252 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9154_CR23","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.endm.2005.06.023","volume":"22","author":"C. Hernando","year":"2005","unstructured":"Hernando, C., Mora, M., Pelayo, I.M., Seara, C., C\u00e1ceres, J., Puertas, M.L.: On the metric dimension of some families of graphs. Electron. Notes Discrete Math. 22, 129\u2013133 (2005)","journal-title":"Electron. Notes Discrete Math."},{"key":"9154_CR24","doi-asserted-by":"crossref","unstructured":"Juhos, I., van\u00a0Hemert, J.I.: Improving graph colouring algorithms and heuristics using a novel representation. In: Lecture Notes in Computer Science, vol.\u00a03906, pp.\u00a0123\u2013134. Springer, Berlin (2006)","DOI":"10.1007\/11730095_11"},{"key":"9154_CR25","volume-title":"Swarm Intelligence","author":"J. Kennedy","year":"2001","unstructured":"Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)"},{"key":"9154_CR26","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"S. Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discrete Appl. Math. 70, 217\u2013229 (1996)","journal-title":"Discrete Appl. Math."},{"key":"9154_CR27","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983). http:\/\/citeseer.ist.psu.edu\/kirkpatrick83optimization.html","journal-title":"Science"},{"key":"9154_CR28","unstructured":"Kova\u010devi\u0107-Vuj\u010di\u0107, V., Mladenovi\u0107, N., \u010cangalovi\u0107, M., Dra\u017ei\u0107, M.: Continuous variable neighborhood search: comparison with exact methods. Yugosl. J. Oper. Res. (accepted for publication)"},{"key":"9154_CR29","first-page":"271","volume":"18","author":"J. Kratica","year":"1999","unstructured":"Kratica, J.: Improving performances of the genetic algorithm by caching. Comput. Artif. Intell. 18, 271\u2013283 (1999)","journal-title":"Comput. Artif. Intell."},{"key":"9154_CR30","unstructured":"Kratica, J.: Parallelization of genetic algorithms for solving some NP-complete problems. Ph.D. thesis, Faculty of Mathematics, University of Belgrade (2000) (in Serbian)"},{"issue":"4","key":"9154_CR31","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1142\/S0217595906001042","volume":"24","author":"J. Kratica","year":"2006","unstructured":"Kratica, J., Stanimirovi\u0107, Z.: Solving the uncapacitated multiple allocation p-hub center problem by genetic algorithm. Asia-Pacific J. Oper. Res. 24(4), 425\u2013438 (2006)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"9154_CR32","first-page":"415","volume":"24","author":"J. Kratica","year":"2005","unstructured":"Kratica, J., Stanimirovi\u0107, Z., To\u0161i\u0107, D., Filipovi\u0107, V.: Genetic algorithms for solving uncapacitated multiple allocation hub median problem. Comput. Inform. 24, 415\u2013426 (2005)","journal-title":"Comput. Inform."},{"issue":"1","key":"9154_CR33","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ejor.2006.06.056","volume":"182","author":"J. Kratica","year":"2007","unstructured":"Kratica, J., Stanimirovi\u0107, Z., To\u0161i\u0107, D., Filipovi\u0107, V.: Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem. Eur. J. Oper. Res. 182(1), 15\u201328 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9154_CR34","unstructured":"Ljubi\u0107, I.: Exact and memetic algorithms for two network design problems. Ph.D. thesis, Institute of Computer Graphics, Vienna University of Technology (2004)"},{"key":"9154_CR35","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1023\/B:HEUR.0000004810.27436.30","volume":"9","author":"I. Ljubi\u0107","year":"2003","unstructured":"Ljubi\u0107, I., Raidl, G.R.: A memetic algorithm for minimum-cost vertex-biconnectivity augmentation of graphs. J. Heuristics 9, 401\u2013427 (2003)","journal-title":"J. Heuristics"},{"issue":"2\u20133","key":"9154_CR36","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I. Ljubi\u0107","year":"2006","unstructured":"Ljubi\u0107, I., Weiskircher, R., Pferschy, U., Klau, G.W., Mutzel, P., Fischetti, M.: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Math. Program. Series B 105(2\u20133), 427\u2013449 (2006)","journal-title":"Math. Program. Series B"},{"issue":"3","key":"9154_CR37","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1162\/1063656041774956","volume":"12","author":"P. Merz","year":"2004","unstructured":"Merz, P.: Advanced fitness landscape analysis and the performance of memetic algorithms. Evol.\u00a0Comput. 12(3), 303\u2013325 (2004)","journal-title":"Evol.\u00a0Comput."},{"issue":"1","key":"9154_CR38","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10589-005-4562-x","volume":"30","author":"A. Misevicius","year":"2005","unstructured":"Misevicius, A.: A tabu search algorithm for the quadratic assignment problem. Comput. Optim. Appl. 30(1), 95\u2013111 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"9154_CR39","author":"N. Mladenovi\u0107","year":"2007","unstructured":"Mladenovi\u0107, N., Dra\u017ei\u0107, M., Kova\u010devi\u0107-Vuj\u010di\u0107, V., \u010cangalovi\u0107, M.: General variable neighborhood search for the continuous optimization. Eur. J. Oper. Res. (2007). doi: 10.1016\/j.ejor.2006.12.064","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9154_CR40","doi-asserted-by":"crossref","first-page":"75","DOI":"10.2298\/YJOR0701075M","volume":"17","author":"S.K. Mondel","year":"2007","unstructured":"Mondel, S.K., Dey, J.K., Maiti, M.: A single period inventory model of a deteriorating item sold from two shops with shortage via genetic algorithm. Yugosl. J. Oper. Res. 17(1), 75\u201394 (2007)","journal-title":"Yugosl. J. Oper. Res."},{"key":"9154_CR41","first-page":"157","volume-title":"Handbook of Applied Optimization","author":"P. Moscato","year":"2002","unstructured":"Moscato, P.: Memetic algorithms. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization, pp.\u00a0157\u2013167. Oxford University Press, Oxford (2002)"},{"key":"9154_CR42","first-page":"33","volume":"69","author":"J. Peters-Fransen","year":"2006","unstructured":"Peters-Fransen, J., Oellermann, O.: The metric dimension of Cartesian products of graphs. Util. Math. 69, 33\u201341 (2006)","journal-title":"Util. Math."},{"key":"9154_CR43","doi-asserted-by":"crossref","unstructured":"Puchinger, J., Raidl, G.R., Pferschy, U.: The core concept for the multidimensional knapsack problem. In: Lecture Notes in Computer Science, vol.\u00a03906, pp.\u00a0195\u2013208. Springer, Berlin (2006)","DOI":"10.1007\/11730095_17"},{"issue":"4","key":"9154_CR44","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1162\/106365605774666886","volume":"13","author":"G.R. Raidl","year":"2005","unstructured":"Raidl, G.R., Gottlieb, J.: Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem. Evol. Comput. 13(4), 441\u2013475 (2005)","journal-title":"Evol. Comput."},{"key":"9154_CR45","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147\u2013167 (1995)","journal-title":"J. Heuristics"},{"issue":"128","key":"9154_CR46","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1023\/B:CMAJ.0000024524.43125.cd","volume":"53","author":"V. Saenpholphat","year":"2003","unstructured":"Saenpholphat, V., Zhang, P.: Connected resolvability of graphs. Czechoslov. Math. J. 53(128), 827\u2013840 (2003)","journal-title":"Czechoslov. Math. J."},{"issue":"129","key":"9154_CR47","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1007\/s10587-004-6417-5","volume":"54","author":"V. Saenpholphat","year":"2004","unstructured":"Saenpholphat, V., Zhang, P.: On connected resolving decompositions in graphs. Czechoslov. Math. J. 54(129), 681\u2013696 (2004)","journal-title":"Czechoslov. Math. J."},{"key":"9154_CR48","first-page":"217","volume":"8","author":"B. Shanmukha","year":"2002","unstructured":"Shanmukha, B., Sooryanarayana, B., Harinath, K.S.: Metric dimension of wheels. Far East J. Appl. Math. 8, 217\u2013229 (2002)","journal-title":"Far East J. Appl. Math."},{"key":"9154_CR49","unstructured":"Stanimirovi\u0107, Z.: Solving some discrete location problems by using genetic algorithms. Master\u2019s thesis, Faculty of Mathematics, University of Belgrade (2004) (in Serbian)"},{"key":"9154_CR50","unstructured":"Stanimirovi\u0107, Z.: An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem. Control Cybern. (submitted)"},{"issue":"3","key":"9154_CR51","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/j.ejor.2006.09.069","volume":"182","author":"Z. Stanimirovi\u0107","year":"2007","unstructured":"Stanimirovi\u0107, Z., Kratica, J., Dugo\u0161ija, Dj.: Genetic algorithms for solving the discrete ordered median problem. Eur. J. Oper. Res. 182(3), 983\u20131001 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9154_CR52","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.tcs.2006.01.001","volume":"355","author":"K. Xu","year":"2006","unstructured":"Xu, K., Li, W.: Many hard examples in exact phase transitions. Theor. Comp. Sci. 355, 291\u2013302 (2006). http:\/\/www.nlsde.buaa.edu.cn\/~kexu\/benchmarks\/pb-benchmarks.htm","journal-title":"Theor. Comp. Sci."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9154-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9154-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9154-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:34Z","timestamp":1559288194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9154-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,4]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["9154"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9154-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,4]]}}}