{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:42:01Z","timestamp":1740145321931,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10100-017-0513-8","type":"journal-article","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T05:54:31Z","timestamp":1513835671000},"page":"759-769","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Complexity indices for the traveling salesman problem based on short edge subgraphs"],"prefix":"10.1007","volume":"26","author":[{"given":"Drago\u0161","family":"Cvetkovi\u0107","sequence":"first","affiliation":[]},{"given":"Mirjana","family":"\u010cangalovi\u0107","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3434-6734","authenticated-orcid":false,"given":"Zorica","family":"Dra\u017ei\u0107","sequence":"additional","affiliation":[]},{"given":"Vera","family":"Kova\u010devi\u0107-Vuj\u010di\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"513_CR1","volume-title":"The traveling salesman problem","author":"DL Applegate","year":"2006","unstructured":"Applegate DL, Cook WJ, Bixby RE, Chv\u00e1tal V (2006) The traveling salesman problem. Princeton University Press, Princeton"},{"issue":"3","key":"513_CR2","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s12043-010-0138-0","volume":"75","author":"B Ashok","year":"2010","unstructured":"Ashok B, Patra TK (2010) Locating phase transitions in computationally hard problems. Pramana 75(3):549\u2013563","journal-title":"Pramana"},{"key":"513_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s B (2001) Random graphs, 2nd edn. Cambridge University Press, Cambridge","edition":"2"},{"key":"513_CR4","first-page":"35","volume":"1","author":"D Cvetkovi\u0107","year":"2012","unstructured":"Cvetkovi\u0107 D (2012) Complexity indices for the travelling salesman problem and data mining. Trans Comb 1:35\u201343","journal-title":"Trans Comb"},{"key":"513_CR5","unstructured":"Cvetkovi\u0107 D, Mitrovi\u0107-Mini\u0107 S (1993) A search strategy in branch and bound algorithms for the traveling salesman problem. Kr\u010dmar-No\u017ei\u0107, E. (ed) In: Proceedings of SYM-OP-IS XX, Beograd, Yugoslavia, pp 137\u2013140"},{"key":"513_CR6","unstructured":"Cvetkovi\u0107 D, Mitrovi\u0107-Mini\u0107 S (2003) A generalized short edge subgraph for a combinatoral optimization problem. In: Proceedings of SYM-OP-IS XXX, Serbia and Montenegro, pp 319\u2013321"},{"issue":"4","key":"513_CR7","first-page":"163","volume":"2","author":"D Cvetkovi\u0107","year":"1992","unstructured":"Cvetkovi\u0107 D, Dimitrijevi\u0107 V, Milosavljevi\u0107 M (1992) A survey of some non-standard traveling salesman problems. Yugosl J Oper Res 2(4):163\u2013185","journal-title":"Yugosl J Oper Res"},{"key":"513_CR8","unstructured":"Cvetkovi\u0107 DM, Dimitrijevi\u0107 V, Milosavljevi\u0107 MM (1996) Variations on the travelling salesman theme. Libra produkt"},{"key":"513_CR9","unstructured":"Cvetkovi\u0107 D, \u010cangalovi\u0107 M, Kova\u010devi\u0107-Vuj\u010di\u0107 V (1999a) Complexity indices for the travelling salesman problem based on a semidefinite relaxation. In: Zbornik radova XXVI Simpozijuma za operaciona istrazivanja, pp 177\u2013180"},{"key":"513_CR10","doi-asserted-by":"crossref","unstructured":"Cvetkovi\u0107 D, \u010cangalovi\u0107 M, Kova\u010devi\u0107-Vuj\u010di\u0107 V (1999b) Semidefinite programming methods for the symmetric traveling salesman problem. In: International conference on integer programming and combinatorial optimization, Springer, Berlin, pp 126\u2013136","DOI":"10.1007\/3-540-48777-8_10"},{"key":"513_CR11","unstructured":"Cvetkovi\u0107 D, \u010cangalovi\u0107 M, Dra\u017ei\u0107 Z, Kova\u010devi\u0107-Vuj\u010di\u0107 V (2016) Some new complexity indices for the traveling salesman problem. In: Zbornik radova XLIII simpozijuma iz operacionih istrazivanja SYM-OP-IS 2016, Tara, pp 283\u2013286"},{"issue":"1\u20132","key":"513_CR12","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0004-3702(96)00030-6","volume":"88","author":"IP Gent","year":"1996","unstructured":"Gent IP, Walsh T (1996) The tsp phase transition. Artif Intell 88(1\u20132):349\u2013358","journal-title":"Artif Intell"},{"key":"513_CR13","unstructured":"Gutin G, Punnen AP (2002) The traveling salesman problem and its variations. Kluwer Academic Publishers, Dordrecht. \n                        http:\/\/site.ebrary.com\/id\/10067445"},{"key":"513_CR14","volume-title":"The traveling salesman problem. A guided tour of combinatorial optimisation","author":"EL Lawler","year":"1985","unstructured":"Lawler EL, Lenstra JK, Kan AR, Shmoys DB (1985) The traveling salesman problem. A guided tour of combinatorial optimisation. Wiley, Hoboken"},{"key":"513_CR15","unstructured":"Mitrovi\u0107-Mini\u0107 S (1994) Improvements of search strategies in branch and bound algorithms for combinatorial optimization problems. Master\u2019s thesis, Faculty of Electrical Engineering, University of Belgrade, Yugoslavia"},{"issue":"1","key":"513_CR16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10100-016-0437-8","volume":"25","author":"U Pferschy","year":"2017","unstructured":"Pferschy U, Stan\u011bk R (2017) Generating subtour elimination constraints for the tsp from pure integer solutions. Cent Eur J Oper Res 25(1):231\u2013260","journal-title":"Cent Eur J Oper Res"},{"issue":"3","key":"513_CR17","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10100-016-0459-2","volume":"25","author":"T Re\u017enar","year":"2017","unstructured":"Re\u017enar T, Martinovi\u010d J, Slaninov\u00e1 K, Grakova E, Vondr\u00e1k V (2017) Probabilistic time-dependent vehicle routing problem. Cent Eur J Oper Res 25(3):545\u2013560","journal-title":"Cent Eur J Oper Res"},{"issue":"5","key":"513_CR18","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles K, Lopes L (2012) Measuring instance difficulty for combinatorial optimization problems. Comput Oper Res 39(5):875\u2013889","journal-title":"Comput Oper Res"},{"key":"513_CR19","doi-asserted-by":"crossref","unstructured":"Smith-Miles K, van Hemert J, Lim XY (2010) Understanding tsp difficulty by learning from evolved instances. In: Learning and intelligent optimization: 4th international conference, LION 4, Venice, Italy, January 2010. Selected Papers, vol 6073, Springer, Berlin, pp 266\u2013280","DOI":"10.1007\/978-3-642-13800-3_29"},{"key":"513_CR20","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2013.11.015","volume":"45","author":"K Smith-Miles","year":"2014","unstructured":"Smith-Miles K, Baatar D, Wreford B, Lewis R (2014) Towards objective measures of algorithm performance across instance space. Comput Oper Res 45:12\u201324","journal-title":"Comput Oper Res"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-017-0513-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-017-0513-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-017-0513-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,18]],"date-time":"2018-08-18T07:54:32Z","timestamp":1534578872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-017-0513-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,21]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["513"],"URL":"https:\/\/doi.org\/10.1007\/s10100-017-0513-8","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2017,12,21]]}}}