{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:35Z","timestamp":1725484295440},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540436768"},{"type":"electronic","value":"9783540478676"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47867-1_7","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T18:47:17Z","timestamp":1179946037000},"page":"83-92","source":"Crossref","is-referenced-by-count":1,"title":["Finding the Exact Integrality Gap for Small Traveling Salesman Problems"],"prefix":"10.1007","author":[{"given":"Sylvia","family":"Boyd","sequence":"first","affiliation":[]},{"given":"Genevi\u00e8ve","family":"Labont\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,21]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s101070050102","volume":"86","author":"S. Boyd","year":"1999","unstructured":"Boyd, S., Carr. R. (1999): A new bound for the ratio between the 2-matching problem and its linear programming relaxation, Math. Prog. Series A 86, 499\u2013514.","journal-title":"Math. Prog. Series A"},{"key":"7_CR2","unstructured":"Boyd, S., Carr, R. (2000): Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices, Technical Report TR-96-12, University of Ottawa, Ottawa."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF01588786","volume":"49","author":"S. Boyd","year":"1991","unstructured":"Boyd, S., Pulleyblank, W.R. (1991): Optimizing over the subtour polytope of the traveling salesman problem, Math. Prog. 49, 163\u2013187.","journal-title":"Math. Prog."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Carr, R., Ravi, R. (1998): A new bound for the 2-edge connected subgraph problem, Proceedings of the Conference on Integer Programming and Combinatorial Optimization (IPCO\u201998).","DOI":"10.1007\/3-540-69346-7_9"},{"key":"7_CR5","unstructured":"Christof, T., L\u00f6bel, A, Stoer, M. (1997): PORTA, A POlyhedron Representation Transformation Algorithm, http:\/\/www.zib.de\/Optimization\/Software\/Porta\/index.html"},{"key":"7_CR6","unstructured":"Christofides, N. (1976): Worst case analysis of a new heuristic for the traveling salesman problem, Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh."},{"key":"7_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lovasz, L., Schrijver, A. (1988): Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin."},{"key":"7_CR8","first-page":"37","volume-title":"The Traveling Salesman Problem","author":"D.S. Johnson","year":"1985","unstructured":"Johnson, D.S., Papadimitriou, C.H. (1985): Computational Complexity, In: Lawler et al, eds., The Traveling Salesman Problem, John Wiley & Sons, Chichester, 37\u201385."},{"key":"7_CR9","unstructured":"McKay, B. (1991): nauty User\u2019s Guide (Version 1.5), Technical Report TR-CS-90-02, Department of Computer Science, Australia National University."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(90)90028-V","volume":"35","author":"D.B. Shmoys","year":"1990","unstructured":"Shmoys, D.B., Williamson, D.P. (1990): Analyzing the Held-Karp TSP bound: A monotonicity property with application, Inf. Process. Lett. 35, 281\u2013285.","journal-title":"Inf. Process. Lett."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0120913","volume":"13","author":"L.A. Woolsey","year":"1980","unstructured":"Woolsey, L.A. (1980): Heuristic analysis, linear programming and branch and bound, Math. Prog. Study 13, 121\u2013134.","journal-title":"Math. Prog. 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\/3-540-47867-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T07:31:41Z","timestamp":1556436701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47867-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540436768","9783540478676"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-47867-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}