{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:33:37Z","timestamp":1757309617589,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030532611"},{"type":"electronic","value":"9783030532628"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-53262-8_6","type":"book-chapter","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T23:12:23Z","timestamp":1595373143000},"page":"66-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Multiple Steiner Traveling Salesman Problem with Order Constraints"],"prefix":"10.1007","author":[{"given":"Raouia","family":"Taktak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Uchoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,22]]},"reference":[{"unstructured":"http:\/\/www.informatik.uni-koeln.de\/abacus\/","key":"6_CR1"},{"unstructured":"http:\/\/www.ilog.com\/products\/cplex\/","key":"6_CR2"},{"unstructured":"http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/","key":"6_CR3"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1008779125567","volume":"17","author":"N Ascheuer","year":"2000","unstructured":"Ascheuer, N., J\u00fcnger, M., Reinelt, G.: A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Comput. Optim. Appl. 17, 61\u201384 (2000)","journal-title":"Comput. Optim. Appl."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/S0895480193259813","volume":"10","author":"M Ba\u00efou","year":"2002","unstructured":"Ba\u00efou, M., Mahjoub, A.R.: Steiner 2-edge connected subgraph polytopes on series-parallel graphs. SIAM J. Discrete Math. 10, 505\u2013514 (2002)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR6","first-page":"241","volume":"68","author":"E Balas","year":"1995","unstructured":"Balas, E., Fischetti, M., Pulleyblank, W.R.: The precedence-constrained asymmetric traveling salesman polytope. Math. Program. 68, 241\u2013265 (1995)","journal-title":"Math. Program."},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209\u2013219 (2006)","journal-title":"Omega"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10479-011-1024-y","volume":"207","author":"E Benavent","year":"2013","unstructured":"Benavent, E., Mart\u00ednez, A.: Multi-depot multiple TSP: a polyhedral study and computational results. Ann. Oper. Res. 207(1), 7\u201325 (2013)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/net.20310","volume":"55","author":"F Bendali","year":"2010","unstructured":"Bendali, F., Diarrassouba, I., Mahjoub, A.R., Didi Biha, M., Mailfert, J.: A branch-and-cut algorithm for the k-edge connected subgraph problem. Networks 55(1), 13\u201332 (2010)","journal-title":"Networks"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-21527-8_22","volume-title":"Network Optimization","author":"S Borne","year":"2011","unstructured":"Borne, S., Gabrel, V., Mahjoub, R., Taktak, R.: Multilayer survivable optical network design. In: Pahl, J., Reiners, T., Vo\u00df, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 170\u2013175. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21527-8_22"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.endm.2013.05.129","volume":"41","author":"S Borne","year":"2013","unstructured":"Borne, S., Mahjoub, A.R., Taktak, R.: A branch-and-cut algorithm for the multiple Steiner TSP with order constraints. Electron. Notes Discrete Math. 41, 487\u2013494 (2013)","journal-title":"Electron. Notes Discrete Math."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G Cornu\u00e9jols","year":"1985","unstructured":"Cornu\u00e9jols, G., Fonlupt, J., Naddef, D.: The traveling salesman problem on a graph and some related integer polyhedra. Math. Program. 33, 1\u201327 (1985)","journal-title":"Math. Program."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1002\/net.21765","volume":"71","author":"L Gouveia","year":"2017","unstructured":"Gouveia, L., Pesneau, P., Ruthmair, M., Santos, D.: Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem. Networks 71, 451\u2013465 (2017)","journal-title":"Networks"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/S0895480102419445","volume":"18","author":"D Huygens","year":"2004","unstructured":"Huygens, D., Mahjoub, A., Pesneau, P.: Two edge-disjoint hop-constrained paths and polyhedra. SIAM J. Discrete Math. 18(2), 287\u2013312 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"6_CR15","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1111\/itor.12419","volume":"24","author":"R Interian","year":"2017","unstructured":"Interian, R., Ribeiro, C.C.: A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem. Int. Trans. Oper. Res. 24(6), 1307\u20131323 (2017)","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ejor.2013.01.044","volume":"228","author":"AN Letchford","year":"2013","unstructured":"Letchford, A.N., Nasiri, S.D., Theis, D.O.: Compact formulations of the Steiner traveling salesman problem and related problems. Eur. J. Oper. Res. 228(1), 83\u201392 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20133","key":"6_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01582572","volume":"64","author":"AR Mahjoub","year":"1994","unstructured":"Mahjoub, A.R.: Two edge connected spanning subgraphs and polyhedra. Math. Program. 64(1\u20133), 199\u2013208 (1994)","journal-title":"Math. Program."},{"issue":"3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1051\/ro:2008022","volume":"42","author":"AR Mahjoub","year":"2008","unstructured":"Mahjoub, A.R., Pesneau, P.: On the steiner 2-edge connected subgraph polytope. RAIRO - Oper. Res. 42(3), 259\u2013283 (2008)","journal-title":"RAIRO - Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Mahjoub, A.R., Taktak, R., Uchoa, E.: A layered compact formulation for the multiple Steiner TSP with order constraints. In: 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT), pp. 1462\u20131467 IEEE (2019)","key":"6_CR19","DOI":"10.1109\/CoDIT.2019.8820661"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.cor.2014.05.014","volume":"51","author":"SC Sarin","year":"2014","unstructured":"Sarin, S.C., Sherali, H.D., Judd, J.D., Tsai, P.-F.J.: Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations. Comput. Oper. Res. 51, 64\u201389 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"6+","key":"6_CR21","first-page":"1349","volume":"29","author":"M Steinov\u00e1","year":"2012","unstructured":"Steinov\u00e1, M.: Approximability of the minimum Steiner cycle problem. Comput. Inform. 29(6+), 1349\u20131357 (2012)","journal-title":"Comput. Inform."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53262-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:08:27Z","timestamp":1710266907000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-53262-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030532611","9783030532628"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53262-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.lamsade.dauphine.fr\/~isco\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Symposia","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.26","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.85","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}