{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T07:49:23Z","timestamp":1769759363337,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T00:00:00Z","timestamp":1341446400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10107-012-0568-1","type":"journal-article","created":{"date-parts":[[2012,7,4]],"date-time":"2012-07-04T22:26:04Z","timestamp":1341440764000},"page":"205-254","source":"Crossref","is-referenced-by-count":26,"title":["The symmetric quadratic traveling salesman problem"],"prefix":"10.1007","volume":"142","author":[{"given":"Anja","family":"Fischer","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Helmberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,5]]},"reference":[{"issue":"1","key":"568_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T. Achterberg","year":"2009","unstructured":"Achterberg T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"568_CR2","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S0097539796312721","volume":"29","author":"A. Aggarwal","year":"1999","unstructured":"Aggarwal A., Coppersmith D., Khanna S., Motwani R., Schieber B.: The angular-metric traveling salesman problem. SIAM J. Comput. 29, 697\u2013711 (1999)","journal-title":"SIAM J. Comput."},{"key":"568_CR3","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1002\/net.20423","volume":"57","author":"E. Amaldi","year":"2011","unstructured":"Amaldi E., Galbiati G., Maffioli F.: On minimum reload cost paths, tours, and flows. Networks 57, 254\u2013260 (2011)","journal-title":"Networks"},{"key":"568_CR4","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)","author":"D.L. Applegate","year":"2007","unstructured":"Applegate D.L., Bixby R.E., Chvatal V., Cook W.J.: The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press, Princeton (2007)"},{"key":"568_CR5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A. Billionnet","year":"2007","unstructured":"Billionnet A., Elloumi S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Math. Program. 109, 55\u201368 (2007)","journal-title":"Math. Program."},{"key":"568_CR6","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1016\/j.dam.2007.12.007","volume":"157","author":"A. Billionnet","year":"2009","unstructured":"Billionnet A., Elloumi S., Plateau M.C.: Improving the performance of standard solvers for quadratic 0\u20131 programs by a tight convex reformulation: the QCR method. Discrete Appl. Math. 157, 1185\u20131197 (2009)","journal-title":"Discrete Appl. Math."},{"key":"568_CR7","doi-asserted-by":"crossref","unstructured":"Burkard, R., \u00c7ela, E., Klinz, B.: On the biquadratic assignment problem. In: Pardalos P., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16. pp. 117\u2013146 (1994)","DOI":"10.1090\/dimacs\/016\/05"},{"key":"568_CR8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01580109","volume":"5","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal V.: Edmonds polytopes and weakly hamiltonian graphs. Math. Program. 5, 29\u201340 (1973)","journal-title":"Math. Program."},{"key":"568_CR9","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"G. Dantzig","year":"1954","unstructured":"Dantzig G., Fulkerson R., Johnson S.: Solution of a large-scale traveling-salesman problem. Oper. Res. 2, 393\u2013410 (1954)","journal-title":"Oper. Res."},{"issue":"4","key":"568_CR10","doi-asserted-by":"crossref","first-page":"1559","DOI":"10.1137\/070711141","volume":"19","author":"E. De Klerk","year":"2008","unstructured":"De Klerk E., Pasechnik D.V., Sotirov R.: On semidefinite programming relaxations of the traveling salesman problem. SIAM J. Optim. 19(4), 1559\u20131573 (2008)","journal-title":"SIAM J. Optim."},{"issue":"9","key":"568_CR11","doi-asserted-by":"crossref","first-page":"1380","DOI":"10.1016\/j.dam.2005.05.037","volume":"154","author":"U. Faigle","year":"2006","unstructured":"Faigle U., Frahling G.: A combinatorial algorithm for weighted stable sets in bipartite graphs. Discrete Appl. Math. 154(9), 1380\u20131391 (2006)","journal-title":"Discrete Appl. Math."},{"key":"568_CR12","unstructured":"Fischer, F., J\u00e4ger, G., Lau, A., Molitor, P.: Complexity and Algorithms for the Traveling Salesman Problem and the Assignment Problem of Second Order. Preprint 2009-16, Fakult\u00e4t f\u00fcr Mathematik, Technische Universit\u00e4t Chemnitz, D-09107 Chemnitz, Germany (2009)"},{"key":"568_CR13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.endm.2010.05.011","volume":"36","author":"G. Galbiati","year":"2010","unstructured":"Galbiati G., Gualandi S., Maffioli F.: On minimum reload cost cycle cover. Electron. Notes Discrete Math. 36, 81\u201388 (2010)","journal-title":"Electron. Notes Discrete Math."},{"key":"568_CR14","doi-asserted-by":"crossref","first-page":"1404","DOI":"10.1016\/j.dam.2010.03.009","volume":"158","author":"L. Gourv\u00e8s","year":"2010","unstructured":"Gourv\u00e8s L., Lyra A., Martinhon C., Monnot J.: The minimum reload s-t path, trail and walk problems. Discrete Appl. Math. 158, 1404\u20131417 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"568_CR15","first-page":"33","volume":"21","author":"M. Gr\u00f6tschel","year":"1977","unstructured":"Gr\u00f6tschel M., Padberg M.W.: Lineare Charakterisierungen von Travelling Salesman Problemen. Zeitschrift f\u00fcr Oper. Res. Ser. A 21(1), 33\u201364 (1977)","journal-title":"Zeitschrift f\u00fcr Oper. Res. Ser. A"},{"key":"568_CR16","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01582116","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel M., Padberg M.W.: On the symmetric travelling salesman problem I: inequalities. Math. Program. 16, 265\u2013280 (1979)","journal-title":"Math. Program."},{"key":"568_CR17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01582117","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel M., Padberg M.W.: On the symmetric travelling salesman problem II: lifting theorems and facets. Math. Program. 16, 281\u2013302 (1979)","journal-title":"Math. Program."},{"key":"568_CR18","volume-title":"The Traveling Salesman Problem and Its Variations (Combinatorial Optimization)","author":"G. Gutin","year":"2002","unstructured":"Gutin G., Punnen A., Barvinok A., Gimadi E.K., Serdyukov A.I.: The Traveling Salesman Problem and Its Variations (Combinatorial Optimization). Springer, Berlin (2002)"},{"key":"568_CR19","unstructured":"Hong, S.: A Linear Programming Approach for the Traveling Salesman Problem. Ph.D. thesis, John Hopkins University, Baltimore, MD, USA (1972)"},{"key":"568_CR20","unstructured":"IBM ILOG CPLEX 12.2: Using the CPLEX callable library. Information available at http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/"},{"key":"568_CR21","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/978-3-540-85097-7_20","volume":"5165","author":"G. J\u00e4ger","year":"2008","unstructured":"J\u00e4ger G., Molitor P.: Algorithms and experimental study for the traveling salesman problem of second order. Lect. Notes Comput. Sci. 5165, 211\u2013224 (2008)","journal-title":"Lect. Notes Comput. Sci."},{"key":"568_CR22","volume-title":"The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R., Shmoys, D.B. (eds): The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)"},{"issue":"2","key":"568_CR23","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz L., Schrijver A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1(2), 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"568_CR24","unstructured":"Mathematica 7. Information available at http:\/\/www.wolfram.com\/mathematica\/"},{"key":"568_CR25","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M. Padberg","year":"1989","unstructured":"Padberg M.: The Boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45, 139\u2013172 (1989)","journal-title":"Math. Program."},{"key":"568_CR26","unstructured":"SCIP 2.1.1. Information available at http:\/\/scip.zib.de\/"},{"key":"568_CR27","unstructured":"Shor, N.Z.: Quadratic optimization problems. Sov. J. Comput. Syst. Sci. 25, 1\u201311 (1987). Originally published in Tekhnicheskaya Kibernetika, No. 1, 1987, pp. 128\u2013139"},{"key":"568_CR28","first-page":"78","volume-title":"Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 1665","author":"H.C. Wirth","year":"1999","unstructured":"Wirth H.C., Steffan J.: On minimum diameter spanning trees under reload costs. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds) Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 1665, pp. 78\u201389. Springer, Berlin (1999)"},{"issue":"6","key":"568_CR29","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1089\/cmb.2005.12.894","volume":"12","author":"X. Zhao","year":"2005","unstructured":"Zhao X., Huang H., Speed T.P.: Finding short DNA motifs using permuted markov models. J. Comput. Biol. 12(6), 894\u2013906 (2005)","journal-title":"J. Comput. Biol."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0568-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0568-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0568-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T06:57:54Z","timestamp":1594364274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0568-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,5]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["568"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0568-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,5]]}}}