{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T08:47:13Z","timestamp":1771145233226,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,8,11]],"date-time":"2013-08-11T00:00:00Z","timestamp":1376179200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10878-013-9647-3","type":"journal-article","created":{"date-parts":[[2013,8,10]],"date-time":"2013-08-10T11:16:32Z","timestamp":1376133392000},"page":"489-519","source":"Crossref","is-referenced-by-count":5,"title":["An extended approach for lifting clique tree inequalities"],"prefix":"10.1007","volume":"30","author":[{"given":"Anja","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,11]]},"reference":[{"key":"9647_CR1","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 (1999) The angular-metric traveling salesman problem. SIAM J Comput 29:697\u2013711","journal-title":"SIAM J Comput"},{"key":"9647_CR2","doi-asserted-by":"crossref","unstructured":"Amaldi E, Galbiati G, Maffioli F (2011) On minimum reload cost paths, tours, and flows. Networks 57:254\u2013260","DOI":"10.1002\/net.20423"},{"key":"9647_CR3","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. Oper Res 2:393\u2013410","journal-title":"Oper Res"},{"key":"9647_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69 B","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Maximum matching and a polyhedron with $$0,1$$ 0 , 1 vertices. J Res Nat Bureau Stand 69 B:125\u2013130","journal-title":"J Res Nat Bureau Stand"},{"key":"9647_CR5","unstructured":"Fischer A (2011) The asymmetric quadratic traveling salesman problem. Preprint 2011\u20132019, Fakult\u00e4t f\u00fcr Mathematik, Technische Universit\u00e4t Chemnitz, D-09107 Chemnitz, Germany"},{"key":"9647_CR6","unstructured":"Fischer A, Helmberg C (2012) The symmetric quadratic traveling salesman problem. Math Program 1\u201350"},{"issue":"1","key":"9647_CR7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0166-218X(93)E0082-A","volume":"56","author":"M Fischetti","year":"1995","unstructured":"Fischetti M (1995) Clique tree inequalities define facets of the asymmetric traveling salesman polytope. Discret Appl Math 56(1):9\u201318","journal-title":"Discret Appl Math"},{"issue":"1","key":"9647_CR8","first-page":"33","volume":"21","author":"M Gr\u00f6tschel","year":"1977","unstructured":"Gr\u00f6tschel M, Padberg MW (1977) Lineare Charakterisierungen von Travelling Salesman Problemen. Zeitschrift f\u00fcr Oper Res Ser A 21(1):33\u201364","journal-title":"Zeitschrift f\u00fcr Oper Res Ser A"},{"key":"9647_CR9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01582116","volume":"16","author":"M Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel M, Padberg MW (1979a) On the symmetric travelling salesman problem I: inequalities. Math Program 16:265\u2013280","journal-title":"Math Program"},{"key":"9647_CR10","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01582117","volume":"16","author":"M Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel M, Padberg MW (1979b) On the symmetric travelling salesman problem II: lifting theorems and facets. Math Program 16:281\u2013302","journal-title":"Math Program"},{"key":"9647_CR11","unstructured":"Gr\u00f6tschel M, Padberg MW (1985) Polyhedral theory. In: Lawler EL, Lenstra JK, Kan AHGR, Shmoys DB (Eds) The traveling salesman problem. A guided tour of combinatorial optimization, chap 8, pp 251\u2013306"},{"issue":"4","key":"9647_CR12","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1287\/moor.11.4.537","volume":"11","author":"M Gr\u00f6tschel","year":"1986","unstructured":"Gr\u00f6tschel M, Pulleyblank WR (1986) Clique tree inequalities and the symmetric travelling salesman problem. Math Oper Res 11(4):537\u2013569","journal-title":"Math Oper Res"},{"key":"9647_CR13","doi-asserted-by":"crossref","unstructured":"J\u00e4ger G, Molitor P (2008) Algorithms and experimental study for the traveling salesman problem of second order. Lecture notes in computer science vol 5165. Springer, Berlin pp 211\u2013224","DOI":"10.1007\/978-3-540-85097-7_20"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9647-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9647-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9647-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:21Z","timestamp":1559276601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9647-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,11]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9647"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9647-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,11]]}}}