{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T03:47:22Z","timestamp":1780631242234,"version":"3.54.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030944780","type":"print"},{"value":"9783030944797","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-94479-7_13","type":"book-chapter","created":{"date-parts":[[2022,1,7]],"date-time":"2022-01-07T09:02:57Z","timestamp":1641546177000},"page":"191-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Declarative Solutions of\u00a0Sequencing Problems Using Multi-valued Decision Diagrams and\u00a0GPUs"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Tardivo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,1,7]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Akers, S.: Binary decision diagrams. IEEE Trans. Comput. C-27 (1978). https:\/\/doi.org\/10.1109\/tc.1978.1675141","DOI":"10.1109\/tc.1978.1675141"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Andersen, H.R., Hadzic, T., Hooker, J.N., Tiedemann, P.: A constraint store based on multivalued decision diagrams. In: Principles and Practice of Constraint Programming \u2013 CP 2007. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_11","DOI":"10.1007\/978-3-540-74970-7_11"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Bach, L., Hasle, G., Schulz, C.: Adaptive large neighborhood search on the graphics processing unit. Eur. J. Oper. Res. 275 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.11.035","DOI":"10.1016\/j.ejor.2018.11.035"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J., Hooker, J.N.: Discrete optimization with decision diagrams. INFORMS J. Comput. 28(2016). https:\/\/doi.org\/10.1287\/ijoc.2015.0648","DOI":"10.1287\/ijoc.2015.0648"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1007\/978-3-319-10428-7_64","volume-title":"Principles and Practice of Constraint Programming","author":"D Bergman","year":"2014","unstructured":"Bergman, D., Cir\u00e9, A.A., van Hoeve, W.-J., Hooker, J.N.: Optimization bounds from binary decision diagrams. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 903\u2013907. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_64"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35 (1986). https:\/\/doi.org\/10.1109\/tc.1986.1676819","DOI":"10.1109\/tc.1986.1676819"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Campeotto, F., Dovier, A., Fioretto, F., Pontelli, E.: A GPU implementation of large neighborhood search for solving constraint optimization problems. In: ECAI (2014). https:\/\/doi.org\/10.3233\/978-1-61499-419-0-189","DOI":"10.3233\/978-1-61499-419-0-189"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Cire, A.A., van Hoeve, W.J.: Multivalued decision diagrams for sequencing problems. Oper. Res. 61 (2013). https:\/\/doi.org\/10.1287\/opre.2013.1221","DOI":"10.1287\/opre.2013.1221"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-319-98334-9_6","volume-title":"Principles and Practice of Constraint Programming","author":"JJ Dekker","year":"2018","unstructured":"Dekker, J.J., de la Banda, M.G., Schutt, A., Stuckey, P.J., Tack, G.: Solver-independent large neighbourhood search. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 81\u201398. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_6"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cyber. Part B (Cybernetics) 26 (1996). https:\/\/doi.org\/10.1109\/3477.484436","DOI":"10.1109\/3477.484436"},{"key":"13_CR11","unstructured":"Gecode team: Gecode, https:\/\/www.gecode.org"},{"key":"13_CR12","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4","volume-title":"Handbook of Metaheuristics","year":"2019","unstructured":"Gendreau, M., Potvin, J.-Y. (eds.): Handbook of Metaheuristics. ISORMS, vol. 272. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13 (1986). https:\/\/doi.org\/10.1016\/0305-0548(86)90048-1","DOI":"10.1016\/0305-0548(86)90048-1"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Goldberg, D.E.: Genetic algorithms in search, optimization, and machine learning. Choice Reviews Online 27 (1989). https:\/\/doi.org\/10.5860\/choice.27-0936","DOI":"10.5860\/choice.27-0936"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Gu\u00e9ret, C., Prins, C.: A new lower bound for the open-shop problem. Ann. Oper. Res. 92 (1999). https:\/\/doi.org\/10.1023\/A:1018930613891","DOI":"10.1023\/A:1018930613891"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Hifi, M., Negre, S., Saadi, T., Saleh, S., Wu, L.: A parallel large neighborhood search-based heuristic for the disjunctively constrained knapsack problem. In: 2014 IEEE International Parallel & Distributed Processing Symposium Workshops (2014). https:\/\/doi.org\/10.1109\/ipdpsw.2014.173","DOI":"10.1109\/ipdpsw.2014.173"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-15396-9_23","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"S Hoda","year":"2010","unstructured":"Hoda, S., van Hoeve, W.-J., Hooker, J.N.: A systematic approach to MDD-based constraint programming. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 266\u2013280. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15396-9_23"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-38171-3_7","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"JN Hooker","year":"2013","unstructured":"Hooker, J.N.: Decision diagrams and dynamic programming. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 94\u2013110. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38171-3_7"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220 (1983). https:\/\/doi.org\/10.1126\/science.220.4598.671","DOI":"10.1126\/science.220.4598.671"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Koehler, J., et al.: Cable tree wiring - benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints. Constraints 26, 56\u2013106 (2021). https:\/\/doi.org\/10.1007\/s10601-021-09321-w","DOI":"10.1007\/s10601-021-09321-w"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Lee, C.Y.: Representation of switching circuits by binary-decision programs. Bell Syst. Tech.l J. 38 (1959). https:\/\/doi.org\/10.1002\/j.1538-7305.1959.tb01585.x","DOI":"10.1002\/j.1538-7305.1959.tb01585.x"},{"key":"13_CR22","unstructured":"Marte, M.: Yuck. https:\/\/github.com\/informarte\/yuck"},{"key":"13_CR23","unstructured":"MiniZinc Team: The minizinc benchmark suite. https:\/\/github.com\/MiniZinc\/minizinc-benchmarks"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24 (1997). https:\/\/doi.org\/10.1016\/s0305-0548(97)00031-2","DOI":"10.1016\/s0305-0548(97)00031-2"},{"key":"13_CR25","unstructured":"Nvidia Team: CUDA toolkit documentation. https:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide, (Accessed on 04\/22\/2021)"},{"key":"13_CR26","unstructured":"Nvidia Team: GPU accelerated applications. https:\/\/www.nvidia.com\/en-us\/gpu-accelerated-applications. Accessed 22 Apr 2021"},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"O\u2019Neil, R.J., Hoffman, K.: Decision diagrams for solving traveling salesman problems with pickup and delivery in real time. Oper. Res. Lett. 47 (2019). https:\/\/doi.org\/10.1016\/j.orl.2019.03.008","DOI":"10.1016\/j.orl.2019.03.008"},{"key":"13_CR28","volume-title":"Parallel Large Neighborhood Search","author":"L Perron","year":"2003","unstructured":"Perron, L., Shaw, P., Sa, I.: Parallel Large Neighborhood Search. Tech. rep, ILOG SA (2003)"},{"key":"13_CR29","unstructured":"Reinelt, G.: Traveling salesman problem library. http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/index.html"},{"key":"13_CR30","unstructured":"R\u00f8pke, S.: PALNS - a software framework for parallel large neighborhood search. In: Metaheuristic International Conference (2009)"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40 (2006). https:\/\/doi.org\/10.1287\/trsc.1050.0135","DOI":"10.1287\/trsc.1050.0135"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming \u2014 CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"key":"13_CR33","doi-asserted-by":"publisher","unstructured":"S\u00f6rensen, K., Glover, F.W.: Metaheuristics. In: Encyclopedia of Operations Research and Management Science. Springer, Boston (2013). https:\/\/doi.org\/10.1007\/978-1-4419-1153-7_1167","DOI":"10.1007\/978-1-4419-1153-7_1167"},{"key":"13_CR34","unstructured":"Tardivo, F.: MDD-lns, https:\/\/github.com\/95A31\/MDD-LNS"},{"key":"13_CR35","doi-asserted-by":"publisher","unstructured":"Wong, H., Papadopoulou, M.M., Sadooghi-Alvandi, M., Moshovos, A.: Demystifying GPU microarchitecture through microbenchmarking. In: 2010 IEEE International Symposium on Performance Analysis of Systems & Software (ISPASS) (2010). https:\/\/doi.org\/10.1109\/ispass.2010.5452013","DOI":"10.1109\/ispass.2010.5452013"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-94479-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,21]],"date-time":"2022-04-21T17:06:14Z","timestamp":1650560774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94479-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030944780","9783030944797"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94479-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Philadelphia, PA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl22.sigplan.org\/home\/PADL-2022","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":"22","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":"9","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":"4","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":"41% - 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":"3","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)"}}]}}