{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:54:10Z","timestamp":1725458050967},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642321467"},{"type":"electronic","value":"9783642321474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32147-4_11","type":"book-chapter","created":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T07:54:50Z","timestamp":1341474890000},"page":"105-116","source":"Crossref","is-referenced-by-count":2,"title":["The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks"],"prefix":"10.1007","author":[{"given":"Sylvie","family":"Borne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Grappe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Lacroix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Alba, M., Cordeau, J.-F., Dell\u2019Amico, M., Iori, M.: A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks. INFORMS Journal on Computing (2011) (published online)"},{"issue":"45","key":"11_CR2","doi-asserted-by":"publisher","first-page":"6261","DOI":"10.1016\/j.tcs.2011.07.012","volume":"412","author":"F. Bonomo","year":"2011","unstructured":"Bonomo, F., Mattia, S., Oriolo, G.: Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. Theoretical Computer Science\u00a0412(45), 6261\u20136268 (2011)","journal-title":"Theoretical Computer Science"},{"key":"11_CR3","unstructured":"Carrabs, F., Cerulli, R., Speranza, M.G.: A Branch-and-Bound Algorithm for the Double TSP with Two Stacks. Technical report (2010)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1016\/j.cor.2011.06.008","volume":"39","author":"M. Casazza","year":"2012","unstructured":"Casazza, M., Ceselli, A., Nunkesser, M.: Efficient algorithms for the double traveling salesman problem with multiple stacks. Computers & Operations Research\u00a039, 1044\u20131053 (2012)","journal-title":"Computers & Operations Research"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"2983","DOI":"10.1016\/j.cor.2009.01.015","volume":"36","author":"A. Felipe","year":"2009","unstructured":"Felipe, A., Ortuno, M.T., Tirado, G.: The Double Traveling Salesman Problem with Multiple Stacks: A Variable Neighborhood Search Approach. Computers & Operations Research\u00a036, 2983\u20132993 (2009)","journal-title":"Computers & Operations Research"},{"key":"11_CR6","unstructured":"Gutan, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. In: Combinatorial Optimization, vol.\u00a012. Kluwer Academic Publishers (2002)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1111\/j.1475-3995.2009.00748.x","volume":"17","author":"R.M. Lusby","year":"2010","unstructured":"Lusby, R.M., Larsen, J., Ehrgott, M., Ryan, D.: An exact method for the double TSP with multiple stacks. International Transactions on Operations Research\u00a017, 637\u2013652 (2010)","journal-title":"International Transactions on Operations Research"},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/net.20375","volume":"56","author":"H.L. Petersen","year":"2010","unstructured":"Petersen, H.L., Archetti, C., Sperenza, M.G.: Exact Solutions to the Double Travelling Salesman Problem with Multiple Stacks. Networks\u00a056(4), 229\u2013243 (2010)","journal-title":"Networks"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.ejor.2008.08.009","volume":"198","author":"H.L. Petersen","year":"2009","unstructured":"Petersen, H.L., Madsen, O.B.G.: The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches. European Journal of Operation Research\u00a0198(1), 139\u2013147 (2009)","journal-title":"European Journal of Operation Research"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","volume":"23","author":"A. Pnueli","year":"1971","unstructured":"Pnueli, A., Lempel, A., Even, S.: Transitive orientation of graphs and identification of permutation graphs. Canadian Journal of Mathematics\u00a023, 160\u2013175 (1971)","journal-title":"Canadian Journal of Mathematics"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Toulouse, S.: Approximability of the Multiple Stack TSP. In: International Symposium on Combinatorial Optimization (ISCO 2010), ENDM 813-820 (2010)","DOI":"10.1016\/j.endm.2010.05.103"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-642-02017-9_38","volume-title":"Theory and Applications of Models of Computation","author":"S. Toulouse","year":"2009","unstructured":"Toulouse, S., Wolfler Calvo, R.: On the Complexity of the Multiple Stack TSP, kSTSP. In: Chen, J., Cooper, S.B. (eds.) TAMC 2009. LNCS, vol.\u00a05532, pp. 360\u2013369. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32147-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:55:58Z","timestamp":1620114958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32147-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642321467","9783642321474"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32147-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}