{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T14:12:57Z","timestamp":1773583977266,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,9,10]],"date-time":"2014-09-10T00:00:00Z","timestamp":1410307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s11590-014-0790-2","type":"journal-article","created":{"date-parts":[[2014,9,9]],"date-time":"2014-09-09T08:01:14Z","timestamp":1410249674000},"page":"1057-1067","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Symmetry properties of resolving sets and metric bases in hypercubes"],"prefix":"10.1007","volume":"11","author":[{"given":"Neboj\u0161a","family":"Nikoli\u0107","sequence":"first","affiliation":[]},{"given":"Mirjana","family":"\u010cangalovi\u0107","sequence":"additional","affiliation":[]},{"given":"Igor","family":"Gruji\u010di\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,10]]},"reference":[{"key":"790_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1112\/blms\/bdq096","volume":"43","author":"R Bailey","year":"2011","unstructured":"Bailey, R., Cameron, P.: Base size, metric dimension and other invariants of groups and graphs. Bull. Lond. Math. Soc. 43, 209\u2013242 (2011)","journal-title":"Bull. Lond. Math. Soc."},{"key":"790_CR2","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/050641867","volume":"21","author":"J Caceres","year":"2007","unstructured":"Caceres, J., Hernando, C., Mora, M., Pelayo, I., Puertas, M., Seara, C., Wood, D.: On the metric dimension of cartesian product of graphs. SIAM J. Discret. Math. 21, 423\u2013441 (2007)","journal-title":"SIAM J. Discret. Math."},{"key":"790_CR3","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., Eroh, L., Johnson, M., Oellermann, O.: Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. 105, 99\u2013113 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"790_CR4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1986.1057187","volume":"32","author":"JH Conway","year":"1986","unstructured":"Conway, J.H., Sloane, N.J.A.: Lexicographic codes: error-correcting codes from game theory. IEEE Trans. Inf. Theory 32(3), 337\u2013348 (1986)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"790_CR5","first-page":"157","volume":"39","author":"JD 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."},{"key":"790_CR6","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On two problems of information theory. Publications of the Mathematical Institute of the Hungarian Academy of Sciences, vol. 8, pp. 229\u2013243 (1963)"},{"issue":"1","key":"790_CR7","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. Discret. Math. 306(1), 31\u201341 (2006)","journal-title":"Discret. Math."},{"key":"790_CR8","unstructured":"Ganesan, A.: Minimal resolving sets for the hypercube. Cornell University Library. \n                        arXiv:1106.3632v3\n                        \n                     [cs.DM] (2012)"},{"issue":"2","key":"790_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s11590-011-0409-9","volume":"7","author":"TP Gevezes","year":"2013","unstructured":"Gevezes, T.P., Pitsoulis, L.S.: A new greedy algorithm for the quadratic assignment problem. Optim. Lett. 7(2), 207\u2013220 (2013)","journal-title":"Optim. Lett."},{"issue":"3","key":"790_CR10","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.cor.2011.02.010","volume":"39","author":"J Gorski","year":"2012","unstructured":"Gorski, J., Paquete, L., Pedrosa, F.: Greedy algorithms for a class of knapsack problems with binary weights. Comput. Oper. Res. 39(3), 498\u2013511 (2012)","journal-title":"Comput. Oper. Res."},{"key":"790_CR11","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":"790_CR12","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., Caceres, J., Puertas, M.L.: On the metric dimension of some families of graphs. Electron. Notes Discret. Math. 22, 129\u2013133 (2005)","journal-title":"Electron. Notes Discret. Math."},{"key":"790_CR13","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.endm.2007.07.058","volume":"29","author":"C Hernando","year":"2007","unstructured":"Hernando, C., Mora, M., Pelayo, I.M., Seara, C., Wood, D.R.: Extremal graph theory for metric dimension and diameter. Electron. Notes Discret. Math. 29, 339\u2013343 (2007)","journal-title":"Electron. Notes Discret. Math."},{"key":"790_CR14","doi-asserted-by":"crossref","unstructured":"Kabatianski, G., Lebedev, V.S., Thorpe, J.: The Mastermind game and the rigidity of Hamming space. In: Proceedings of the IEEE International Symposium on Information Theory, ISIT\u201900, pp. 375 (2000)","DOI":"10.1109\/ISIT.2000.866673"},{"key":"790_CR15","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. Discret. Appl. Math. 70, 217\u2013229 (1996)","journal-title":"Discret. Appl. Math."},{"key":"790_CR16","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10589-007-9154-5","volume":"44","author":"J Kratica","year":"2009","unstructured":"Kratica, J., Kova\u010devi\u0107-Vuj\u010di\u0107, V., \u010cangalovi\u0107, M.: Computing the metric dimension of graphs by genetic algorithms. Comput. Optim. Appl. 44, 343\u2013361 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"790_CR17","doi-asserted-by":"crossref","first-page":"2149","DOI":"10.1016\/j.cor.2008.08.002","volume":"36","author":"J Kratica","year":"2009","unstructured":"Kratica, J., \u010cangalovi\u0107, M., Kova\u010devi\u0107-Vuj\u010di\u0107, V.: Computing minimal doubly resolving sets of graphs. Comput. Oper. Res. 36, 2149\u20132159 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"790_CR18","doi-asserted-by":"crossref","first-page":"143","DOI":"10.2298\/YJOR0802143K","volume":"18","author":"J Kratica","year":"2008","unstructured":"Kratica, J., Kova\u010devi\u0107-Vuj\u010di\u0107, V., \u010cangalovi\u0107, M.: Computing strong metric dimension of some special classes of graphs by genetic algorithms. Yugosl. J. Oper. Res. 18(2), 143\u2013151 (2008)","journal-title":"Yugosl. J. Oper. Res."},{"key":"790_CR19","unstructured":"Lindstr\u00f6m, B.: On a combinatory detection problem. Publications of the Mathematical Institute of the Hungarian Academy of Sciences, vol. 9, pp. 195\u2013207 (1964)"},{"issue":"2","key":"790_CR20","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s11590-012-0590-5","volume":"8","author":"Z Lu","year":"2014","unstructured":"Lu, Z., Wu, L., Pardalos, P.M., Maslov, E., Lee, W., Du, D.Z.: Routing-efficient CDS construction in Disk-Containment Graphs. Optim. Lett. 8(2), 425\u2013434 (2014)","journal-title":"Optim. Lett."},{"key":"790_CR21","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/j.ejor.2012.02.019","volume":"220","author":"N Mladenovi\u0107","year":"2012","unstructured":"Mladenovi\u0107, N., Kratica, J., Kova\u010devi\u0107-Vuj\u010di\u0107, V., \u010cangalovi\u0107, M.: Variable nighborhood search for metric dimension and minimal doubly resolving set problems. Eur. J. Oper. Res. 220, 328\u2013337 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"790_CR22","first-page":"33","volume":"69","author":"O Oellermann","year":"2006","unstructured":"Oellermann, O., Peters-Fransen, J.: The metric dimension of Cartesian products of graphs. Util. Math. 69, 33\u201341 (2006)","journal-title":"Util. Math."},{"key":"790_CR23","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."},{"issue":"2","key":"790_CR24","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/moor.1030.0070","volume":"29","author":"A Seb\u00f6","year":"2004","unstructured":"Seb\u00f6, A., Tannier, E.: On metric generators of graphs. Math. Oper. Res. 29(2), 383\u2013393 (2004)","journal-title":"Math. Oper. Res."},{"key":"790_CR25","first-page":"549","volume":"14","author":"P Slater","year":"1975","unstructured":"Slater, P.: Leaves of trees. Congr. Numerantium 14, 549\u2013559 (1975)","journal-title":"Congr. Numerantium"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0790-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0790-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0790-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0790-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:39Z","timestamp":1559394699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0790-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,10]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["790"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0790-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,10]]}}}