{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:41:18Z","timestamp":1725892878918},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660194"},{"type":"electronic","value":"9783540487777"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48777-8_19","type":"book-chapter","created":{"date-parts":[[2007,3,2]],"date-time":"2007-03-02T13:43:11Z","timestamp":1172842991000},"page":"242-258","source":"Crossref","is-referenced-by-count":2,"title":["The m-Cost ATSP"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Helmberg","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E. Balas","year":"1989","unstructured":"E. Balas. The prize collecting traveling salesman problem. Networks, 19:621\u2013636, 1989.","journal-title":"Networks"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1002\/net.3230250406","volume":"25","author":"E. Balas","year":"1995","unstructured":"E. Balas. The prize collecting traveling salesman problem: II. polyhedral results. Networks, 25:199\u2013216, 1995.","journal-title":"Networks"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01581274","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas and M. Fischetti. A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Mathematical Programming, 58:325\u2013352, 1993.","journal-title":"Mathematical Programming"},{"key":"19_CR4","series-title":"Handbooks in Operations Research and Management Science","volume-title":"Network Routing","year":"1995","unstructured":"M._O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors. Network Routing, volume 8 of Handbooks in Operations Research and Management Science. Elsevier Sci. B.V., Amsterdam, 1995."},{"key":"19_CR5","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0927-0507(05)80106-9","volume-title":"Time Constrained Routing and Scheduling","author":"J. Desrosiers","year":"1995","unstructured":"J. Desrosiers, Y. Dumas, M. M. Solomon, and F. Soumis. Time Constrained Routing and Scheduling, chapter 2, pages 35\u2013139. Volume 8 of Ball et al. [4], 1995."},{"key":"19_CR6","unstructured":"M. Fischetti, J. Salazar Gonz\u00e1lez, and P. Toth. A branch-and-cut algorithm for the generalized travelling salesman problem. Technical report, University of Padova, 1994."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"1520","DOI":"10.1287\/mnsc.43.11.1520","volume":"43","author":"M. Fischetti","year":"1997","unstructured":"M. Fischetti and P. Toth. A polyhedral approach to the asymmetric traveling salesman problem. Management Science, 43:1520\u20131536, 1997.","journal-title":"Management Science"},{"key":"19_CR8","unstructured":"M. Fischetti and P. Toth. An additive approach for the optimal solution of the prize-collecting travelling salesman problem. In B. Golden and A. Assad, editors, Vehicle Routing: Methods and Studies, pages 319\u2013343. Elsevier Science Publishers B.V. (North-Holland), 1998."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q","volume":"32","author":"M. Gendreau","year":"1998","unstructured":"M. Gendreau, G. Laporte, and F. Semet. A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks, 32:263\u2013273, 1998.","journal-title":"Networks"},{"key":"19_CR10","volume-title":"The Traveling Salesman Problem","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel and M. Padberg. Polyhedral theory. In [12], chapter 8."},{"key":"19_CR11","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, Network Models, volume 7 of Handbooks in Operations Research and Management Science, chapter 4, pages 225\u2013330. North Holland, 1995.","DOI":"10.1016\/S0927-0507(05)80121-5"},{"volume-title":"The Traveling Salesman Problem","year":"1985","key":"19_CR12","unstructured":"E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors. The Traveling Salesman Problem. John Wiley & Sons Ltd, Chichester, 1985."},{"key":"19_CR13","volume-title":"The Traveling Salesman Problem","author":"M. Padberg","year":"1985","unstructured":"M. Padberg and M. Gr\u00f6tschel. Polyhedral computations. In [12], chapter 9."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"M. Padberg","year":"1990","unstructured":"M. Padberg and G. Rinaldi. Facet identification for the symmetric traveling salesman polytope. Mathematical Programming, 47:219\u2013257, 1990.","journal-title":"Mathematical Programming"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M. Padberg","year":"1991","unstructured":"M. Padberg and G. Rinaldi. A branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review, 33:60\u2013100, 1991.","journal-title":"SIAM Review"},{"key":"19_CR16","series-title":"Lect Notes Comput Sci","volume-title":"The traveling salesman-Computational solutions for TSP applications","author":"G. Reinelt","year":"1994","unstructured":"G. Reinelt. The traveling salesman-Computational solutions for TSP applications. Number 840 in Lecture Notes in Computer Science. Springer-Verlag, 1994."}],"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-48777-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T02:18:28Z","timestamp":1556158708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48777-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660194","9783540487777"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48777-8_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}