{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:10Z","timestamp":1725559150971},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261995"},{"type":"electronic","value":"9783540321026"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496915_34","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T16:40:39Z","timestamp":1279125639000},"page":"468-482","source":"Crossref","is-referenced-by-count":2,"title":["Not Every GTSP Facet Induces an STSP Facet"],"prefix":"10.1007","author":[{"given":"Marcus","family":"Oswald","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Reinelt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk Oliver","family":"Theis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56628-8","volume-title":"Linear optimization and extensions: problems and solutions","author":"D. Alevras","year":"2001","unstructured":"Alevras, D., Padberg, M.W.: Linear optimization and extensions: problems and solutions. Springer, Heidelberg (2001)"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: On the solution of the Traveling Salesman Problem. In: Doc. Math. J. DMV (Extra Volume ICM), pp. 645\u2013656 (1998)","DOI":"10.4171\/dms\/1-3\/62"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-45586-8_7","volume-title":"Computational Combinatorial Optimization","author":"D. Applegate","year":"2001","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: TSP cuts which do not conform to the template paradigm. In: J\u00fcnger, M., Naddef, D. (eds.) Computational Combinatorial Optimization, pp. 261\u2013303. Springer, Heidelberg (2001)"},{"issue":"1\u20132","key":"34_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-003-0440-4","volume":"97","author":"D. Applegate","year":"2003","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: Implementing the Dantzig-Fulkerson-Johnson algorithm for large Traveling Salesman Problems. Math. Program. Ser. B\u00a097(1\u20132), 91\u2013153 (2003)","journal-title":"Math. Program. Ser. B"},{"issue":"2","key":"34_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1287\/moor.16.2.259","volume":"16","author":"S.C. Boyd","year":"1991","unstructured":"Boyd, S.C., Cunningham, W.H.: Small Travelling Salesman Polytopes. Math. Oper. Res.\u00a016(2), 259\u2013271 (1991)","journal-title":"Math. Oper. Res."},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Carr, R.: Separating over classes of TSP inequalities defined by 0-node lifting in polynomial time. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds.) Proc. IPCO V, pp. 460\u2013474 (1996)","DOI":"10.1007\/3-540-61310-2_34"},{"issue":"1","key":"34_CR7","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/moor.1030.0058","volume":"29","author":"R. Carr","year":"2004","unstructured":"Carr, R.: Separation algorithms for classes of STSP inequalities arising from a new STSP relaxation. Math. Oper. Res.\u00a029(1), 80\u201391 (2004)","journal-title":"Math. Oper. Res."},{"key":"34_CR8","first-page":"497","volume":"10","author":"T. Christof","year":"1991","unstructured":"Christof, T., J\u00fcnger, M., Reinelt, G.: A complete description of the traveling salesman polytope on 8 nodes. OR Letters\u00a010, 497\u2013500 (1991)","journal-title":"OR Letters"},{"key":"34_CR9","unstructured":"Christof, T., L\u00f6bel, A.: PORTA \u2013 a polyhedron representation algorithm (1998), http:\/\/www.informatik.uni-heidelberg.de\/groups\/comopt\/software\/PORTA\/"},{"key":"34_CR10","unstructured":"Christof, T., Reinelt, G.: SmaPo \u2013 library of Small Polytopes, http:\/\/www.informatik.uni-heidelberg.de\/groups\/comopt\/software\/SMAPO\/\/tsp\/tsp.html"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0218195901000560","volume":"11","author":"T. Christof","year":"2001","unstructured":"Christof, T., Reinelt, G.: Decomposition and parallelization techniques for enumerating the facets of combinatorial polytopes. Int. J. Comput. Geom. Appl.\u00a011, 423\u2013437 (2001)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G. Cornu\u00e9jols","year":"1985","unstructured":"Cornu\u00e9jols, G., Fonlupt, J., Naddef, D.: The Traveling Salesman Problem on a Graph and some related Integer Polyhedra. Math. Program.\u00a033, 1\u201327 (1985)","journal-title":"Math. Program."},{"key":"34_CR13","doi-asserted-by":"publisher","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.\u00a02, 393\u2013410 (1954)","journal-title":"Oper. Res."},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0377-2217(85)90151-1","volume":"21","author":"B. Fleischmann","year":"1985","unstructured":"Fleischmann, B.: A cutting plane procedure for the travelling salesman problem on road networks. Eur. J. Oper. Res.\u00a021, 307\u2013317 (1985)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"34_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01585700","volume":"53","author":"J. Fonlupt","year":"1992","unstructured":"Fonlupt, J., Naddef, D.: The Traveling Salesman Problem in graphs whith some excluded minors. Math. Program.\u00a053(2), 147\u2013172 (1992)","journal-title":"Math. Program."},{"issue":"2","key":"34_CR16","first-page":"335","volume":"69","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X.: Worst-case comparison of valid inequalities for the TSP. Math. Program.\u00a069(2), 335\u2013349 (1995)","journal-title":"Math. Program."},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01586945","volume":"51","author":"D. Naddef","year":"1991","unstructured":"Naddef, D., Rinaldi, G.: The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities. Math. Program.\u00a051, 359\u2013400 (1991)","journal-title":"Math. Program."},{"key":"34_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01581259","volume":"58","author":"D. Naddef","year":"1993","unstructured":"Naddef, D., Rinaldi, G.: The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope. Math. Program.\u00a058, 53\u201388 (1993)","journal-title":"Math. Program."},{"key":"34_CR19","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496915_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T02:52:09Z","timestamp":1685674329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496915_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261995","9783540321026"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11496915_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}