{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:52Z","timestamp":1725664372038},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613107"},{"type":"electronic","value":"9783540684534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61310-2_34","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:28:13Z","timestamp":1330291693000},"page":"460-474","source":"Crossref","is-referenced-by-count":9,"title":["Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time"],"prefix":"10.1007","author":[{"given":"Robert","family":"Carr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/moor.16.2.259","volume":"16","author":"S. Boyd","year":"1991","unstructured":"S. Boyd and W. H. Cunningham (1991), Small travelling salesman polytopes, Mathematics of Operations Research 16 259\u2013271","journal-title":"Mathematics of Operations Research"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"B. Carr, (1995) Separating clique tree and bipartition inequalities having a fixed number of handles and teeth in polynomial time, IPCO proceedings","DOI":"10.1007\/3-540-59408-6_40"},{"key":"34_CR3","unstructured":"M. J\u00fcnger, G. Reinelt, and G. Rinaldi (1994), The traveling salesman problem, Istituto Di Analisi Dei Sistemi Ed Informatica, R. 375, p. 53"},{"key":"34_CR4","unstructured":"M. J\u00fcnger, G. Reinelt, and G. Rinaldi (1994), The traveling salesman problem, Istituto Di Analisi Dei Sistemi Ed Informatica, R. 375, p. 59"},{"key":"34_CR5","unstructured":"D. Karger, (1994), Random Sampling in Graph Optimization Problems, PhD Thesis, Department of Computer Science, Stanford University"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01902503","volume":"28","author":"L. Lovasz","year":"1976","unstructured":"L. Lovasz (1976), On some connectivity properties of Eulerian graphs, Acta Math. Acad. Sci. Hungar., Vol. 28, 129\u2013138","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01581259","volume":"58","author":"D. Naddef","year":"1992","unstructured":"D. Naddef, G. Rinaldi (1992), The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope, Mathematical Programming 58, 53\u201388","journal-title":"Mathematical Programming"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"M. Yannakakis (1988), Expressing combinatorial optimization problems by linear programs, Proceedings of the 29th IEEE FOCS, 223\u2013228","DOI":"10.1145\/62212.62232"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61310-2_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:15Z","timestamp":1605647115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61310-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613107","9783540684534"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-61310-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}