{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:11:32Z","timestamp":1743073892667,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332708"},{"type":"electronic","value":"9783031332715"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33271-5_32","type":"book-chapter","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:03:04Z","timestamp":1684774984000},"page":"493-509","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Combining Incomplete Search and\u00a0Clause Generation: An Application to\u00a0the\u00a0Orienteering Problems with\u00a0Time Windows"],"prefix":"10.1007","author":[{"given":"Trong-Hieu","family":"Tran","sequence":"first","affiliation":[]},{"given":"C\u00e9dric","family":"Pralet","sequence":"additional","affiliation":[]},{"given":"H\u00e9l\u00e8ne","family":"Fargier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Audemard, G., Lagniez, J.M., Mazure, B., Sa\u00efs, L.: Integrating conflict driven clause learning to local search. In: 6th International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS 2009) (2009)","DOI":"10.1109\/ICTAI.2009.71"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-39071-5_23","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2013","author":"G Audemard","year":"2013","unstructured":"Audemard, G., Lagniez, J.-M., Simon, L.: Improving glucose for incremental SAT solving with assumptions: application to MUS extraction. In: J\u00e4rvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 309\u2013317. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39071-5_23"},{"issue":"1","key":"32_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM (JACM) 9(1), 61\u201363 (1962)","journal-title":"J. ACM (JACM)"},{"issue":"8","key":"32_CR4","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"100","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. Comput. IEEE Trans. 100(8), 677\u2013691 (1986)","journal-title":"Comput. IEEE Trans."},{"key":"32_CR5","unstructured":"Crawford, J.: Solving satisfiability problems using a combination of systematic and local search. In: Second Challenge on Satisfiability Testing organized by Center for Discrete Mathematics and Computer Science of Rutgers University (1996)"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intell. Res. 17, 229\u2013264 (2002)","journal-title":"J. Artif. Intell. Res."},{"issue":"4","key":"32_CR7","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S1571-0661(05)82542-3","volume":"89","author":"N E\u00e9n","year":"2003","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Temporal induction by incremental SAT solving. Electron. Notes Theor. Comput. Sci. 89(4), 543\u2013560 (2003)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Gillard, X., Schaus, P.: Large neighborhood search with decision diagrams. In: International Joint Conference on Artificial Intelligence (2022)","DOI":"10.24963\/ijcai.2022\/659"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"2093","DOI":"10.1007\/978-1-4613-0303-9_33","volume-title":"Handbook of Combinatorial Optimization","author":"F Glover","year":"1998","unstructured":"Glover, F., Laguna, M.: Tabu search. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 2093\u20132229. Springer, Boston (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_33"},{"issue":"3","key":"32_CR10","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"BL Golden","year":"1987","unstructured":"Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Naval Res. Logistics (NRL) 34(3), 307\u2013318 (1987)","journal-title":"Naval Res. Logistics (NRL)"},{"issue":"2","key":"32_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","volume":"255","author":"A Gunawan","year":"2016","unstructured":"Gunawan, A., Lau, H.C., Vansteenwegen, P.: Orienteering problem: a survey of recent variants, solution approaches and applications. Eur. J. Oper. Res. 255(2), 315\u2013332 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"32_CR12","volume-title":"Constraint-Based Local Search","author":"PV Hentenryck","year":"2005","unstructured":"Hentenryck, P.V., Michel, L.: Constraint-Based Local Search. The MIT Press, Cambridge (2005)"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10472-005-0421-9","volume":"43","author":"E Hirsch","year":"2002","unstructured":"Hirsch, E., Kojevnikov, A.: UnitWalk: a new SAT solver that uses local search guided by unit clause elimination. Ann. Math. Artif. Intell. 43, 91\u2013111 (2002)","journal-title":"Ann. Math. Artif. Intell."},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J Hooker","year":"2003","unstructured":"Hooker, J., Ottosson, G.: Logic-based Benders\u2019 decomposition. Math. Program. Ser. B 96, 33\u201360 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-21581-0_8","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"A Ignatiev","year":"2011","unstructured":"Ignatiev, A., Semenov, A.: DPLL+ROBDD derivation applied to inversion of some cryptographic functions. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 76\u201389. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21581-0_8"},{"issue":"6","key":"32_CR16","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1057\/jors.1992.88","volume":"43","author":"MG Kantor","year":"1992","unstructured":"Kantor, M.G., Rosenwein, M.B.: The orienteering problem with time windows. J. Oper. Res. Soc. 43(6), 629\u2013635 (1992)","journal-title":"J. Oper. Res. Soc."},{"key":"32_CR17","unstructured":"Li, X.Y., Stallmann, M.F., Brglez, F.: QingTing: a fast SAT solver using local search and efficient unit propagation. In: Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003) (2003)"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Handbook of Satisfiability, pp. 133\u2013182. IOS Press (2021)","DOI":"10.3233\/FAIA200987"},{"issue":"3","key":"32_CR19","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018999721141","volume":"22","author":"B Mazure","year":"1998","unstructured":"Mazure, B., Sais, L., Gr\u00e9goire, \u00c9.: Boosting complete techniques thanks to local search methods. Ann. Math. Artif. Intell. 22(3), 319\u2013331 (1998)","journal-title":"Ann. Math. Artif. Intell."},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th annual Design Automation Conference, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-31612-8_19","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"A Nadel","year":"2012","unstructured":"Nadel, A., Ryvchin, V.: Efficient SAT solving under assumptions. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 242\u2013255. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31612-8_19"},{"issue":"3","key":"32_CR22","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/A:1009694016861","volume":"5","author":"G Pesant","year":"1999","unstructured":"Pesant, G., Gendreau, M.: A constraint programming framework for local search methods. J. Heuristics 5(3), 255\u2013279 (1999)","journal-title":"J. Heuristics"},{"key":"32_CR23","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-91086-4_4","volume-title":"Handbook of Metaheuristics","author":"D Pisinger","year":"2019","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 99\u2013127. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_4"},{"key":"32_CR24","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-78295-7_3","volume-title":"Hybrid Metaheuristics","author":"S Prestwich","year":"2008","unstructured":"Prestwich, S.: The relation between complete and incomplete search. In: Blum, C., Aguilera, M.J.B., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics. Studies in Computational Intelligence, vol. 114, pp. 63\u201383. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78295-7_3"},{"key":"32_CR25","unstructured":"Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Proceedings of 1993 International Conference on Computer Aided Design (ICCAD), pp. 42\u201347. IEEE (1993)"},{"issue":"1","key":"32_CR26","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"MW Savelsbergh","year":"1985","unstructured":"Savelsbergh, M.W.: Local search in routing problems with time windows. Ann. Oper. Res. 4(1), 285\u2013305 (1985)","journal-title":"Ann. Oper. Res."},{"key":"32_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-68496-3_1","volume-title":"Computational Logistics","author":"V Schmid","year":"2017","unstructured":"Schmid, V., Ehmke, J.F.: An effective large neighborhood search for the team orienteering problem with time windows. In: ICCL 2017. LNCS, vol. 10572, pp. 3\u201318. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68496-3_1"},{"issue":"3","key":"32_CR28","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10951-012-0285-x","volume":"16","author":"A Schutt","year":"2013","unstructured":"Schutt, A., Feydy, T., Stuckey, P., Wallace, M.: Solving RCPSP\/max by lazy clause generation. J. Sched. 16(3), 273\u2013289 (2013)","journal-title":"J. Sched."},{"issue":"2","key":"32_CR29","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"key":"32_CR30","doi-asserted-by":"crossref","unstructured":"Soos, M., Nohl, K., Castelluccia, C.: Extending SAT solvers to cryptographic problems. In: 12th International Conference on Theory and Applications of Satisfiability Testing (SAT), pp. 244\u2013257 (2009)","DOI":"10.1007\/978-3-642-02777-2_24"},{"issue":"12","key":"32_CR31","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","volume":"36","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P., Souffriau, W., Berghe, G.V., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36(12), 3281\u20133290 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"32_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The orienteering problem: a survey. Eur. J. Oper. Res. 209(1), 1\u201310 (2011)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33271-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:08:13Z","timestamp":1684775293000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33271-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332708","9783031332715"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33271-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 May 2023","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":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2023","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":"71","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":"26","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":"6","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":"37% - 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","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":"4","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)"}}]}}