{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T23:18:14Z","timestamp":1756682294967,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031264184"},{"type":"electronic","value":"9783031264191"}],"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-26419-1_26","type":"book-chapter","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:24:57Z","timestamp":1679876697000},"page":"426-442","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the\u00a0Generalization of\u00a0Neural Combinatorial Optimization Heuristics"],"prefix":"10.1007","author":[{"given":"Sahil","family":"Manchanda","sequence":"first","affiliation":[]},{"given":"Sofia","family":"Michel","sequence":"additional","affiliation":[]},{"given":"Darko","family":"Drakulic","sequence":"additional","affiliation":[]},{"given":"Jean-Marc","family":"Andreoli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,17]]},"reference":[{"key":"26_CR1","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The traveling salesman problem: a computational study. Princeton University Press (Sep 2011)"},{"key":"26_CR2","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. arXiv:1611.09940 (Jan 2017)"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: A methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Cappart, Q., Ch\u00e9telat, D., Khalil, E., Lodi, A., Morris, C., Veli\u010dkovi\u0107, P.: Combinatorial optimization and reasoning with graph neural networks. arXiv:2102.09544 (Feb 2021)","DOI":"10.24963\/ijcai.2021\/595"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley-Interscience, New York, 1st edition edn. (Nov 1997)","DOI":"10.1002\/9781118033142"},{"key":"26_CR6","unstructured":"Finn, C., Abbeel, P., Levine, S.: Model-agnostic meta-learning for fast adaptation of deep networks. In: Proceedings of the 34th International Conference on Machine Learning - Vol. 70. pp. 1126\u20131135. ICML 2017, JMLR.org, Sydney, NSW, Australia (Aug 2017)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Lodi, A.: Heuristics in mixed integer programming. In: Wiley Encyclopedia of Operations Research and Management Science. American Cancer Society (2011)","DOI":"10.1002\/9780470400531.eorms0376"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Fu, Z.H., Qiu, K.B., Zha, H.: Generalize a small pre-trained model to arbitrarily large TSP instances. arXiv:2012.10658 (Dec 2020)","DOI":"10.1609\/aaai.v35i8.16916"},{"key":"26_CR9","unstructured":"Georgiev, D., Li\u00f2, P.: Neural bipartite matching. arXiv:2005.11304 (Jun 2020)"},{"key":"26_CR10","unstructured":"Helsgaun, K.: An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems, p. 60 (2017)"},{"key":"26_CR11","unstructured":"Joshi, C.K., Cappart, Q., Rousseau, L.M., Laurent, T., Bresson, X.: Learning TSP requires rethinking generalization. arXiv:2006.07054 (Jun 2020)"},{"key":"26_CR12","unstructured":"Joshi, C.K., Laurent, T., Bresson, X.: An efficient graph convolutional network technique for the travelling salesman problem. arXiv:1906.01227 (Jun 2019)"},{"key":"26_CR13","unstructured":"Joshi, C.K., Laurent, T., Bresson, X.: on learning paradigms for the travelling salesman problem. arXiv:1910.07210 (Oct 2019)"},{"key":"26_CR14","unstructured":"Kool, W., van Hoof, H., Welling, M.: attention, learn to solve routing problems! In: International Conference on Learning Representations (2019)"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Kool, W., van Hoof, H., Gromicho, J., Welling, M.: Deep policy dynamic programming for vehicle routing problems. arXiv:2102.11756 (Feb 2021)","DOI":"10.1007\/978-3-031-08011-1_14"},{"key":"26_CR16","unstructured":"Li, S., Yan, Z., Wu, C.: Learning to delegate for large-scale vehicle routing. In: Advances in Neural Information Processing Systems 34 Pre-Proceedings (2021)"},{"key":"26_CR17","unstructured":"Li, Z., Chen, Q., Koltun, V.: Combinatorial optimization with graph convolutional networks and guided tree search. In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems 31, pp. 537\u2013546. Curran Associates, Inc. (2018)"},{"key":"26_CR18","unstructured":"Lisicki, M., Afkanpour, A., Taylor, G.W.: Evaluating curriculum learning strategies in neural combinatorial optimization. arXiv:2011.06188 (Nov 2020)"},{"key":"26_CR19","unstructured":"Nair, V., Dvijotham, D., Dunning, I., Vinyals, O.: Learning fast optimizers for contextual stochastic integer programs. In: UAI 2018 (2018)"},{"key":"26_CR20","unstructured":"Nazari, M., Oroojlooy, A., Snyder, L., Takac, M.: Reinforcement learning for solving the vehicle routing problem. In: Advances in Neural Information Processing Systems, vol. 31. Curran Associates, Inc. (2018)"},{"key":"26_CR21","unstructured":"Nichol, A., Achiam, J., Schulman, J.: On first-order meta-learning algorithms. arXiv:1803.02999 (Oct 2018)"},{"key":"26_CR22","unstructured":"Ravi, S., Larochelle, H.: optimization as a model for few-shot learning, p. 11 (2017)"},{"key":"26_CR23","doi-asserted-by":"publisher","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: An analysis of several heuristics for the traveling salesman problem. In: Ravi, S.S., Shukla, S.K. (eds.) Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz, pp. 45\u201369. Springer, Netherlands, Dordrecht (2009). https:\/\/doi.org\/10.1007\/978-1-4020-9688-4_3","DOI":"10.1007\/978-1-4020-9688-4_3"},{"key":"26_CR24","unstructured":"Schmidhuber, J.: Evolutionary principles in self-referential learning, or on learning how to learn: The meta-meta-... hook (1987)"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Tzeng, E., Hoffman, J., Saenko, K., Darrell, T.: Adversarial discriminative domain adaptation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 7167\u20137176 (2017)","DOI":"10.1109\/CVPR.2017.316"},{"key":"26_CR26","unstructured":"Vaswani, A., et al.: Attention is all you need. arXiv:1706.03762 (Jun 2017)"},{"key":"26_CR27","unstructured":"Veli\u010dkovi\u0107, P., Ying, R., Padovano, M., Hadsell, R., Blundell, C.: Neural execution of graph algorithms. In: International Conference on Learning Representations (Sep 2019)"},{"key":"26_CR28","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Cortes, C., Lawrence, N.D., Lee, D.D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems 28, pp. 2692\u20132700. Curran Associates, Inc. (2015)"},{"issue":"3","key":"26_CR29","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00992696","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach. Learn. 8(3), 229\u2013256 (1992)","journal-title":"Mach. Learn."},{"issue":"1","key":"26_CR30","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"26_CR31","doi-asserted-by":"crossref","unstructured":"Zarpellon, G., Jo, J., Lodi, A., Bengio, Y.: Parameterizing branch-and-bound search trees to learn branching policies. arXiv:2002.05120 (Jun 2021)","DOI":"10.1609\/aaai.v35i5.16512"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26419-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:33:01Z","timestamp":1679877181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26419-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031264184","9783031264191"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26419-1_26","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":"17 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1060","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":"236","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":"22% - 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-4","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-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)"}},{"value":"17 demo track papers have been accepted from 28 submissions","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)"}}]}}