{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:44:52Z","timestamp":1743079492655,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030589417"},{"type":"electronic","value":"9783030589424"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-58942-4_20","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"300-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive CP-Based Lagrangian Relaxation for TSP Solving"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Isoart","sequence":"first","affiliation":[]},{"given":"Jean-Charles","family":"R\u00e9gin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"20_CR1","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)"},{"key":"20_CR2","unstructured":"Beasley, J.E.: Lagrangian Relaxation, Chap. 6, pp. 243\u2013303. Wiley, New York (1993)"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10601-012-9119-x","volume":"17","author":"P Benchimol","year":"2012","unstructured":"Benchimol, P., van Hoeve, W.J., R\u00e9gin, J., Rousseau, L., Rueher, M.: Improved filtering for weighted circuit constraints. Constraints 17(3), 205\u2013233 (2012). https:\/\/doi.org\/10.1007\/s10601-012-9119-x","journal-title":"Constraints"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-23219-5_3","volume-title":"Principles and Practice of Constraint Programming","author":"D Bergman","year":"2015","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.-J.: Improved constraint propagation via Lagrangian decomposition. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 30\u201338. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_3"},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/s10601-015-9191-0","volume":"20","author":"H Cambazard","year":"2015","unstructured":"Cambazard, H., Fages, J.-G.: New filtering for AtMostNValue and its weighted variant: a Lagrangian approach. Constraints 20(3), 362\u2013380 (2015). https:\/\/doi.org\/10.1007\/s10601-015-9191-0","journal-title":"Constraints"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Caseau, Y., Laburthe, F.: Solving small TSPs with constraints. In: ICLP, vol. 97, p. 104 (1997)","DOI":"10.7551\/mitpress\/4299.003.0028"},{"key":"20_CR7","unstructured":"Demassey, S.: Compositions and hybridizations for applied combinatorial optimization. Habilitation \u00e0 Diriger des Recherches (2017)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Ducomman, S., Cambazard, H., Penz, B.: Alternative filtering for the weighted circuit constraint: comparing lower bounds for the TSP and solving TSPTW. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, Arizona, USA, 12\u201317 February 2016, pp. 3390\u20133396 (2016)","DOI":"10.1609\/aaai.v30i1.10434"},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10601-014-9178-2","volume":"21","author":"J-G Fages","year":"2014","unstructured":"Fages, J.-G., Lorca, X., Rousseau, L.-M.: The salesman and the tree: the importance of search in CP. Constraints 21(2), 145\u2013162 (2014). https:\/\/doi.org\/10.1007\/s10601-014-9178-2","journal-title":"Constraints"},{"issue":"4","key":"20_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1023\/A:1014492408220","volume":"34","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: Embedding relaxations in global constraints for solving TSP and TSPTW. Ann. Math. Artif. Intell. 34(4), 291\u2013311 (2002). https:\/\/doi.org\/10.1023\/A:1014492408220","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4","key":"20_CR11","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1287\/ijoc.14.4.403.2827","volume":"14","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: A hybrid exact algorithm for the TSPTW. INFORMS J. Comput. 14(4), 403\u2013417 (2002)","journal-title":"INFORMS J. Comput."},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-10428-7_25","volume-title":"Principles and Practice of Constraint Programming","author":"D Fontaine","year":"2014","unstructured":"Fontaine, D., Michel, L., Van Hentenryck, P.: Constraint-based Lagrangian relaxation. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 324\u2013339. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_25"},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/S1052623498342186","volume":"13","author":"A Frangioni","year":"2002","unstructured":"Frangioni, A.: Generalized bundle methods. SIAM J. Optim. 13(1), 117\u2013156 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: Part II. Math. Program. 1(1), 6\u201325 (1971). https:\/\/doi.org\/10.1007\/BF01584070","journal-title":"Math. Program."},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-030-30048-7_17","volume-title":"Principles and Practice of Constraint Programming","author":"N Isoart","year":"2019","unstructured":"Isoart, N., R\u00e9gin, J.C.: Integration of structural constraints into TSP models. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, pp. 284\u2013299. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_17"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11493853_20","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"MOI Khemmoudj","year":"2005","unstructured":"Khemmoudj, M.O.I., Bennaceur, H., Nagih, A.: Combining arc-consistency and dual Lagrangean relaxation for filtering CSPs. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 258\u2013272. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11493853_20"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Kilby, P., Shaw, P.: Vehicle routing. In: Foundations of Artificial Intelligence, vol. 2, pp. 801\u2013836. Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80027-1"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1613\/jair.5247","volume":"57","author":"A Malapert","year":"2016","unstructured":"Malapert, A., R\u00e9gin, J., Rezgui, M.: Embarrassingly parallel search in constraint programming. J. Artif. Intell. Res. (JAIR) 57, 421\u2013464 (2016)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"20_CR19","unstructured":"Menana, J.: Automates et programmation par contraintes pour la planification de personnel. Ph.D. thesis, Universit\u00e9 de Nantes (2011)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-319-44953-1_25","volume-title":"Principles and Practice of Constraint Programming","author":"A Palmieri","year":"2016","unstructured":"Palmieri, A., R\u00e9gin, J.-C., Schaus, P.: Parallel strategies selection. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 388\u2013404. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_25"},{"issue":"1","key":"20_CR21","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1287\/trsc.32.1.12","volume":"32","author":"G Pesant","year":"1998","unstructured":"Pesant, G., Gendreau, M., Potvin, J.Y., Rousseau, J.M.: An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transp. Sci. 32(1), 12\u201329 (1998)","journal-title":"Transp. Sci."},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-642-40627-0_45","volume-title":"Principles and Practice of Constraint Programming","author":"J-C R\u00e9gin","year":"2013","unstructured":"R\u00e9gin, J.-C., Rezgui, M., Malapert, A.: Embarrassingly parallel search. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 596\u2013610. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_45"},{"issue":"4","key":"20_CR23","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB-a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-30201-8_46","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"M Sellmann","year":"2004","unstructured":"Sellmann, M.: Theoretical foundations of CP-based Lagrangian relaxation. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 634\u2013647. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_46"},{"issue":"1\u20134","key":"20_CR25","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1021845304798","volume":"118","author":"M Sellmann","year":"2003","unstructured":"Sellmann, M., Fahle, T.: Constraint programming based Lagrangian relaxation for the automatic recording problem. Ann. Oper. Res. 118(1\u20134), 17\u201333 (2003). https:\/\/doi.org\/10.1023\/A:1021845304798","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58942-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T02:41:10Z","timestamp":1723603270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_20","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":"19 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","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":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","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":"25","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":"7","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":"35% - 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":"3.08","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.08","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}