{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T18:19:18Z","timestamp":1695579558875},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,7,29]],"date-time":"2006-07-29T00:00:00Z","timestamp":1154131200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,7,29]],"date-time":"2006-07-29T00:00:00Z","timestamp":1154131200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/s10107-006-0011-6","type":"journal-article","created":{"date-parts":[[2006,7,28]],"date-time":"2006-07-28T07:06:18Z","timestamp":1154070378000},"page":"501-519","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the domino-parity inequalities for the STSP"],"prefix":"10.1007","volume":"110","author":[{"given":"Sylvia","family":"Boyd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sally","family":"Cockburn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danielle","family":"Vella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,7,29]]},"reference":[{"key":"11_CR1","volume-title":"Finding cuts in the TSP (A Preliminary Report)","author":"D. Applegate","year":"1995","unstructured":"Applegate D., Bixby R., Chv\u00e1tal V., Cook W. (1995): Finding cuts in the TSP (A Preliminary Report). DIMACS Technical Report 95-05, Rutgers University, New Brunswick"},{"key":"11_CR2","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W., CONCORDE, a code for the solution of the TSP, http:\/\/www.tsp.gatech.edu\/concorde\/."},{"key":"11_CR3","volume-title":"A family of facet-inducing domino-parity inequalities for the STSP","author":"S. Boyd","year":"2001","unstructured":"Boyd S., Cockburn S. (2001): A family of facet-inducing domino-parity inequalities for the STSP. Technical Report TR-2001-09, SITE, University of Ottawa, Ottawa"},{"key":"11_CR4","volume-title":"Distinctness of the twisted comb constraints","author":"S. Boyd","year":"2002","unstructured":"Boyd S., Cockburn S. (2002): Distinctness of the twisted comb constraints. Technical Report TR-2002-01, SITE, University of Ottawa, Ottawa"},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s101079900107","volume":"87","author":"A. Caprara","year":"2000","unstructured":"Caprara A., Fischetti M., Letchford A.N. (2000): On the separation of maximally violated mod-k cuts. Math. Prog. 87, 37\u201356","journal-title":"Math Prog"},{"issue":"2","key":"11_CR6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.22.2.257","volume":"22","author":"R. Carr","year":"1997","unstructured":"Carr R. (1997): Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time. Math. Oper. Res. 22(2): 257\u2013265","journal-title":"Math. Oper. Res."},{"key":"11_CR7","volume-title":"On DP-constraints for the Traveling Salesman Polytope","author":"S. Cockburn","year":"2001","unstructured":"Cockburn S. (2001): On DP-constraints for the Traveling Salesman Polytope. Master\u2019s Thesis, University of Ottawa, Ottawa"},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/moor.24.1.130","volume":"24","author":"L. Fleischer","year":"1999","unstructured":"Fleischer L., Tardos \u00c9 (1999): Separating maximally violated comb inequalities in planar graphs. Math. Oper. Res. 24, 130\u2013148","journal-title":"Math. Oper. Res."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0167-6377(91)90096-8","volume":"10","author":"M. Goemans","year":"1991","unstructured":"Goemans M., Talluri K. (1991): 2-change for k-connected networks. Oper. Res. Lett. 10, 113\u2013117","journal-title":"Oper. Res. Lett."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01582116","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel M., Padberg M. (1979): On the symmetric travelling salesman problem I: Inequalities. Math. Prog. 16, 265\u2013280","journal-title":"Math. Prog."},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01582117","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel M., Padberg M. (1979): On the symmetric travelling salesman problem II: Lifting theorems and facets. Math. Prog. 16, 281\u2013302","journal-title":"Math. Prog."},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1997.1493","volume":"55","author":"M. Henzinger","year":"1997","unstructured":"Henzinger M., Klein P., Rao S., Subramanian S.(1997): Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55(1): 3\u201323","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR13","first-page":"37","volume-title":"The Traveling Salesman Problem.","author":"D.S. Johnson","year":"1985","unstructured":"Johnson D.S., Papadimitriou C.H. (1985): Performance guarantees for heuristics. In: Lawler et\u00a0al. (eds). The Traveling Salesman Problem. Wiley, Chichester, pp. 37\u201385"},{"key":"11_CR14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0927-0507(05)80121-5","volume-title":"Network Models.","author":"M. J\u00fcnger","year":"1995","unstructured":"J\u00fcnger M., Reinelt G., Rinaldi G. (1995): The travelling salesman problem. In: Ball et\u00a0al. (eds). Network Models. Handbooks on Operations Research and Management Science, vol. 7, Elsevier, Amsterdam, pp. 225\u2013330"},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1287\/moor.25.3.443.12213","volume":"25","author":"A.N. Letchford","year":"2001","unstructured":"Letchford A.N. (2001): Separating a superclass of comb inequalities in planar graphs. Math. Oper. Res. 25(3): 443\u2013454","journal-title":"Math. Oper. Res."},{"key":"11_CR16","volume-title":"The domino inequalities for the Symmetric Traveling Salesman Problem","author":"D. Naddef","year":"2001","unstructured":"Naddef D. (2001): The domino inequalities for the Symmetric Traveling Salesman Problem. Technical Report, Laboratoire ID-IMAG, France"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s101070100275","volume":"92","author":"D. Naddef","year":"2002","unstructured":"Naddef D., Thienel S. (2002): Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation. Math. Prog. 92(2): 237\u2013255","journal-title":"Math. Prog."},{"key":"11_CR18","first-page":"307","volume-title":"The Traveling Salesman Problem.","author":"M.W. Padberg","year":"1985","unstructured":"Padberg M.W., Gr\u00f6tschel M. (1985): Polyhedral computations. In: Lawler et\u00a0al. (eds). The Traveling Salesman Problem. Wiley, Chichester, pp. 307\u2013360"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"M.W. Padberg","year":"1982","unstructured":"Padberg M.W., Rao G. (1982): Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7, 67\u201380","journal-title":"Math. Oper. Res."},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"M.W. Padberg","year":"1990","unstructured":"Padberg M.W., Rinaldi G. (1990): Facet identification for the symmetric traveling salesman polytope. Math. Prog. 47, 219\u2013257","journal-title":"Math. Prog."},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M.W. Padberg","year":"1991","unstructured":"Padberg M.W., Rinaldi G. (1991): A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33, 60\u2013100","journal-title":"SIAM Rev."},{"key":"11_CR22","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt G. (1991): TSPLIB\u2013A traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384","journal-title":"ORSA J. Comput."},{"key":"11_CR23","volume-title":"Using DP-constraints to obtain improved TSP solutions","author":"D. Vella","year":"2001","unstructured":"Vella D. (2001): Using DP-constraints to obtain improved TSP solutions. Master\u2019s Thesis, University of Ottawa, Ottawa"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0011-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-006-0011-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0011-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0011-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T18:00:10Z","timestamp":1652810410000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-006-0011-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,29]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["11"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0011-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,29]]},"assertion":[{"value":"29 November 2001","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}