{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:42:06Z","timestamp":1725511326303},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540005803"},{"type":"electronic","value":"9783540364788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36478-1_13","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T14:33:12Z","timestamp":1192890792000},"page":"134-146","source":"Crossref","is-referenced-by-count":0,"title":["A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope"],"prefix":"10.1007","author":[{"given":"Jean Fran\u00e7ois","family":"Maurras","sequence":"first","affiliation":[]},{"given":"Viet Hung","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,1,30]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1137\/0805020","volume":"5","author":"S. Boyd","year":"1995","unstructured":"S. Boyd, W. Cunningham, M. Queyranne, and Y. Wang. Ladders for travelling salesmen. SIAM Journal on Optimization, 5:408\u2013420, 1995.","journal-title":"SIAM Journal on Optimization"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF01580109","volume":"5","author":"V. Chv\u00e1tal","year":"1973","unstructured":"V. Chv\u00e1tal. Edmonds polytopes and weakly hamiltonian graphs. Mathematical Programming, 5:29\u201340, 1973.","journal-title":"Mathematical Programming"},{"key":"13_CR3","unstructured":"B. Fleischman. Cutting planes for the symmetric traveling salesman problem. Technical report, Universitat Hamburg, 1987."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01580734","volume":"40","author":"B. Fleischman","year":"1988","unstructured":"B. Fleischman. A new class of cutting planes for the symmetric travelling salesman problem. Mathematical Programming, 40:225\u2013246, 1988.","journal-title":"Mathematical Programming"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01582116","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"M. Gr\u00f6tschel and M. Padberg. On the symmetric traveling salesman problem I: inequalities. Mathematical Programming, 16:265\u2013280, 1979.","journal-title":"Mathematical Programming"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1287\/moor.11.4.537","volume":"11","author":"M. Gr\u00f6tschel","year":"1986","unstructured":"M. Gr\u00f6tschel and W. Pulleyblank. Clique tree inequalities and the symmetric traveling salesman problem. Mathematics of operations research, 11:537\u2013569, 1986.","journal-title":"Mathematics of operations research"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"M. J\u00fcnger, G. Reinelt, and G. Rinaldi. The traveling salesman problem. In M. Ball, T. Magnanti, C. Monma, and G. Nemhauser, editors, Handbook on Operations Research and Management Science, pages 225\u2013330. North Holland, 1995.","DOI":"10.1016\/S0927-0507(05)80121-5"},{"key":"13_CR8","unstructured":"D. Naddef and G. Rinaldi. The symmetric traveling salesman polytope: new facets from the graphical relaxation. Technical Report 248, Instituto di Analisi dei Sistemi ed Informatica, 1988."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01581259","volume":"58","author":"D. Naddef","year":"1993","unstructured":"D. Naddef and G. Rinaldi. The graphical relaxation: a new framework for the symmetric traveling salesman polytope. Mathematical Programming, 58:53\u201388, 1993.","journal-title":"Mathematical Programming"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"D. Naddef. Handles and teeth in the symmetric traveling salesman polytope. In W. Cook and P. Seymour, editors, Polyhedral Combinatorics, volume 1, pages 61\u201374. DIMACS series in Discrete Mathematics and Theoretical of Computer Science, AMS-ACM, 1990.","DOI":"10.1090\/dimacs\/001\/07"},{"key":"13_CR11","volume-title":"Poly\u00e8dres de cycles: Description, Composition et Lifting de Facettes","author":"V. H. Nguyen","year":"2000","unstructured":"V. H. Nguyen. Poly\u00e8dres de cycles: Description, Composition et Lifting de Facettes. PhD thesis, Universit\u00e9 de la M\u00e9diterran\u00e9e, Marseille, 2000."},{"key":"13_CR12","unstructured":"M. Queyranne and Y. Wang. Facet-tree composition for symmetric travelling salesman polytopes. Technical Report 90-MSC-001, Faculty of Commerce and Business Administration, University of British Columbia, 1990."},{"key":"13_CR13","unstructured":"M. Queyranne and Y. Wang. Composing facets of symmetric travelling salesman polytopes. Technical report, Faculty of Commerce and Business Administration, University of British Columbia, 1991."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization \u2014 Eureka, You Shrink!"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36478-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:02:37Z","timestamp":1556920957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36478-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540005803","9783540364788"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-36478-1_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}