{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:24:19Z","timestamp":1725888259774},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319592497"},{"type":"electronic","value":"9783319592503"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59250-3_10","type":"book-chapter","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T09:04:39Z","timestamp":1495530279000},"page":"111-122","source":"Crossref","is-referenced-by-count":1,"title":["The Saleman\u2019s Improved Tours for Fundamental Classes"],"prefix":"10.1007","author":[{"given":"Sylvia","family":"Boyd","sequence":"first","affiliation":[]},{"given":"Andr\u00e1s","family":"Seb\u0151","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1287\/moor.1080.0337","volume":"33","author":"G Benoit","year":"2008","unstructured":"Benoit, G., Boyd, S.: Finding the exact integrality gap for small traveling salesman problems. Math. Oper. Res. 33(4), 921\u2013931 (2008)","journal-title":"Math. Oper. Res."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1137\/S0895480191222926","volume":"8","author":"A Bouchet","year":"1995","unstructured":"Bouchet, A., Cunningham, W.: Delta-matroids, jump systems, and bisubmodular polyhedra. SIAM J. Discrete Math. 8, 17\u201332 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/j.disopt.2011.05.002","volume":"8","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Carr, R.: Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices. Discrete Optim. 8, 525\u2013539 (2011)","journal-title":"Discrete Optim."},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.7151\/dmgt.1053","volume":"17","author":"H Broersma","year":"1997","unstructured":"Broersma, H., Li, X.: Spanning trees with many or few colors in edge-colored graphs. Discussiones Math. Graph Theory 17, 259\u2013269 (1997)","journal-title":"Discussiones Math. Graph Theory"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-69346-7_9","volume-title":"Integer Programming and Combinatorial Optimization","author":"R Carr","year":"1998","unstructured":"Carr, R., Ravi, R.: A new bound for the 2-edge connected subgraph problem. In: Bixby, R.E., Boyd, E.A., R\u00edos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, pp. 112\u2013125. Springer, Heidelberg (1998). doi: 10.1007\/3-540-69346-7_9"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s10107-004-0506-y","volume":"100","author":"R Carr","year":"2004","unstructured":"Carr, R., Vempala, S.: On the Held-Karp relaxation for the asymmetric and symmetric travelling salesman problem. Math. Program. A 100, 569\u2013587 (2004)","journal-title":"Math. Program. A"},{"key":"10_CR7","unstructured":"Christofides, N.: Worst case analysis of a new heuristic for the traveling salesman problem, Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA (1976)"},{"key":"10_CR8","unstructured":"Edmonds, J.: Submodular functions, matroids, certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., Sch\u00f6nheim, J. (eds.) Combinatorial Structures and Their Applications; Proceedings of the Calgary International Conference on Combinatorial Structures and Their Applications 1969, Gordon and Breach, New York (1970)"},{"issue":"1","key":"10_CR9","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.L.: Matching, euler tours and the chinese postman. Math. Program. 5(1), 88\u2013124 (1973)","journal-title":"Math. Program."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Gharan, S.O., Saberi, A., Singh, M.: A randomized rounding approach to the traveling salesman problem. In: Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science, pp. 550\u2013559 (2011)","DOI":"10.1109\/FOCS.2011.80"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Gottschalk, C., Vygen, J.: Better s-t -tours by Gao trees. In: Louveaux, Skutella (eds.) Proceedings of the 18th IPCO Conference, L\u0131\u00e8ge, Belgium (2016)","DOI":"10.1007\/978-3-319-33461-5_11"},{"key":"10_CR12","unstructured":"Kotzig, A.: Moves without forbidden transitions in a graph. Mat. Casopis Sloven, Akad. Vied 18, 76\u201380 (1968)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.) The Traveling Salesman Problem - A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)","DOI":"10.2307\/2582681"},{"issue":"2","key":"10_CR14","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1287\/moor.2013.0608","volume":"39","author":"F Schalekamp","year":"2014","unstructured":"Schalekamp, F., Williamson, D., van Zuylen, A.: 2-matchings, the traveling salesman problem, and the subtour LP: a proof of the Boyd-Carr conjecture. Math. Oper. Res. 39(2), 403\u2013417 (2014)","journal-title":"Math. Oper. Res."},{"key":"10_CR15","volume-title":"Combinatorial Optimization","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Heidelberg (2003)"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Seb\u0151, A., Benchetrit, Y., Stehlik, M.: Problems about uniform covers, with tours and detours. Matematisches Forschungsinstitut Oberwolfach Report No. 51\/2014, pp. 2912\u20132915 (2015). doi: 10.4171\/OWR\/2014\/51","DOI":"10.4171\/OWR\/2014\/51"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s00493-014-2960-3","volume":"34","author":"A Seb\u0151","year":"2014","unstructured":"Seb\u0151, A., Vygen, J.: Shorter tours by nice ears. Combinatorica 34, 597\u2013629 (2014)","journal-title":"Combinatorica"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Seb\u0151, A., van Zuylen, A.: Paths, The salesman\u2019s improved paths: a 3\/2+1\/34 approximation. In: Foundations of Computer Science, (FOCS 2016), October 2016","DOI":"10.1109\/FOCS.2016.21"},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0020-0190(90)90028-V","volume":"35","author":"D Shmoys","year":"1990","unstructured":"Shmoys, D., Williamson, D.: Analysis of the Held-Karp TSP bound: a monotoncity property with application. Inf. Process. Lett. 35, 281\u2013285 (1990)","journal-title":"Inf. Process. Lett."},{"key":"10_CR20","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BFb0120913","volume":"13","author":"L Wolsey","year":"1980","unstructured":"Wolsey, L.: Heuristic analysis, linear programming and branch and bound. Math. Program. Study 13, 121\u2013134 (1980)","journal-title":"Math. Program. Study"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59250-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T19:49:54Z","timestamp":1569354594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59250-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592497","9783319592503"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59250-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}