{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:52:34Z","timestamp":1725864754092},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319455860"},{"type":"electronic","value":"9783319455877"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45587-7_23","type":"book-chapter","created":{"date-parts":[[2016,9,9]],"date-time":"2016-09-09T00:01:21Z","timestamp":1473379281000},"page":"260-272","source":"Crossref","is-referenced-by-count":3,"title":["A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks"],"prefix":"10.1007","author":[{"given":"Michele","family":"Barbato","sequence":"first","affiliation":[]},{"given":"Roland","family":"Grappe","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Lacroix","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Wolfler\u00a0Calvo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,10]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2007)"},{"key":"23_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.disopt.2016.04.005","volume":"21","author":"M Barbato","year":"2016","unstructured":"Barbato, M., Grappe, R., Lacroix, M., Wolfler Calvo, R.: Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks. Discrete Optim. 21, 25\u201341 (2016)","journal-title":"Discrete Optim."},{"unstructured":"Bornd\u00f6rfer, R.: Aspects of set packing, partitioning, and covering. Doctoral dissertation, Ph. D. thesis, Technischen Universit\u00e4t Berlin, Berlin, Germany (1998)","key":"23_CR3"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-642-32147-4_11","volume-title":"Combinatorial Optimization","author":"S Borne","year":"2012","unstructured":"Borne, S., Grappe, R., Lacroix, M.: The uncapacitated asymmetric traveling salesman problem with multiple stacks. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol. 7422, pp. 105\u2013116. Springer, Heidelberg (2012)"},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1002\/net.21468","volume":"61","author":"F Carrabs","year":"2013","unstructured":"Carrabs, F., Cerulli, R., Speranza, M.G.: A branch-and-bound algorithm for the double travelling salesman with two stacks. Networks 61, 58\u201375 (2013)","journal-title":"Networks"},{"key":"23_CR6","doi-asserted-by":"crossref","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 travelling problem with multiple stacks. Comput. Oper. Res. 39, 1044\u20131053 (2012)","journal-title":"Comput. Oper. Res."},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.20448","volume":"60","author":"J-F C\u00f4t\u00e9","year":"2012","unstructured":"C\u00f4t\u00e9, J.-F., Gendreau, M., Potvin, J.-Y.: Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60, 19\u201330 (2012)","journal-title":"Networks"},{"unstructured":"IBM ILOG $$\\textregistered $$ CPLEX Optimization Studio. http:\/\/www-03.ibm.com\/software\/products\/en\/ibmilogcpleoptistud (2012)","key":"23_CR8"},{"key":"23_CR9","doi-asserted-by":"crossref","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. Comput. Oper. Res. 36, 2983\u20132993 (2009)","journal-title":"Comput. Oper. Res."},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"17:1","DOI":"10.1145\/2716307","volume":"62","author":"S Fiorini","year":"2015","unstructured":"Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., De Wolf, R.: Exponential lower bounds for polytopes in combinatorial optimization. J. ACM 62, 17:1\u201317:23 (2015)","journal-title":"J. ACM"},{"key":"23_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/net.20122","volume":"48","author":"L Gouveia","year":"2006","unstructured":"Gouveia, L., Pesneau, P.: On extended formulations for the precedence constrained asymmetric traveling salesman problem. Networks 48, 77\u201389 (2006)","journal-title":"Networks"},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0377-2217(97)00358-5","volume":"112","author":"L Gouveia","year":"1999","unstructured":"Gouveia, L., Pires, J.M.: The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints. Eur. J. Oper. Res. 112, 134\u2013146 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"M Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: Facets of the linear ordering polytope. Math. Programm. 33, 43\u201360 (1985)","journal-title":"Math. Programm."},{"unstructured":"LEMON-library for efficient modeling and optimization in networks (2010). http:\/\/lemon.cs.elte.hu\/","key":"23_CR14"},{"key":"23_CR15","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1111\/j.1475-3995.2009.00748.x","volume":"17","author":"RM Lusby","year":"2010","unstructured":"Lusby, R.M., Larsen, J., Ehrgott, M., Ryan, D.: An exact method for the double TSP with multiple stacks. Int. Trans. Oper. Res. 17, 637\u2013652 (2010)","journal-title":"Int. Trans. Oper. Res."},{"key":"23_CR16","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1002\/net.20473","volume":"58","author":"RM Lusby","year":"2011","unstructured":"Lusby, R.M., Larsen, J.: Improved exact method for the double TSP with multiple stacks. Networks 58, 290\u2013300 (2011)","journal-title":"Networks"},{"key":"23_CR17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1287\/ijoc.1110.0489","volume":"25","author":"AAM Mart\u00ednez","year":"2011","unstructured":"Mart\u00ednez, A.A.M., Cordeau, J.-F., Dell\u2019Amico, M., Iori, M.: A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks. INFORMS J. Comput. 25, 41\u201355 (2011)","journal-title":"INFORMS J. Comput."},{"key":"23_CR18","volume-title":"Handbook of Applied Optimization","author":"JE Mitchell","year":"2002","unstructured":"Mitchell, J.E.: Branch-and-cut algorithms for combinatorial optimization problems. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization. Oxford University Press, New York (2002)"},{"key":"23_CR19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01589100","volume":"45","author":"P Nobili","year":"1989","unstructured":"Nobili, P., Sassano, A.: Facets and lifting procedures for the set covering polytope. Math. Programm. 45, 111\u2013137 (1989)","journal-title":"Math. Programm."},{"key":"23_CR20","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"MW Padberg","year":"1973","unstructured":"Padberg, M.W.: On the facial structure of set packing polyhedra. Math. Programm. 5, 199\u2013215 (1973)","journal-title":"Math. Programm."},{"key":"23_CR21","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/net.20375","volume":"56","author":"HL Petersen","year":"2010","unstructured":"Petersen, H.L., Archetti, C., Speranza, M.G.: Exact solutions to the double travelling salesman problem with multiple stacks. Networks 56, 229\u2013243 (2010)","journal-title":"Networks"},{"key":"23_CR22","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.ejor.2008.08.009","volume":"198","author":"HL Petersen","year":"2009","unstructured":"Petersen, H.L., Madsen, O.B.G.: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches. Eur. J. Oper. Res. 198, 139\u2013147 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR23","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/s10878-009-9264-3","volume":"21","author":"S Rebennack","year":"2011","unstructured":"Rebennack, S., Oswald, M., Theis, D.O., Seitz, H., Reinelt, G., Pardalos, P.M.: A Branch and Cut solver for the maximum stable set problem. J. Comb. Optim. 21, 434\u2013457 (2011)","journal-title":"J. Comb. Optim."},{"key":"23_CR24","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.orl.2004.03.007","volume":"33","author":"SC Sarin","year":"2005","unstructured":"Sarin, S.C., Sherali, H.D., Bhootra, A.: New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints. Oper. Res. Lett. 33, 62\u201370 (2005)","journal-title":"Oper. Res. Lett."},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 5532, 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-319-45587-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T17:45:41Z","timestamp":1601055941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45587-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319455860","9783319455877"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45587-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}