{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T21:34:07Z","timestamp":1780695247198,"version":"3.54.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031606014","type":"print"},{"value":"9783031605994","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-60599-4_21","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T09:02:09Z","timestamp":1716800529000},"page":"304-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning Heuristics for\u00a0Combinatorial Optimization Problems on K-Partite Hypergraphs"],"prefix":"10.1007","author":[{"given":"Mehdi","family":"Zouitine","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmad","family":"Berjaoui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Agn\u00e8s","family":"Lagnoux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cl\u00e9ment","family":"Pellegrini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emmanuel","family":"Rachelson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1287\/opre.39.1.150","volume":"39","author":"E Balas","year":"1991","unstructured":"Balas, E., Saltzman, M.J.: An algorithm for the three-index assignment problem. Oper. Res. 39(1), 150\u2013161 (1991)","journal-title":"Oper. Res."},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11424925_43","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2005","author":"H Bekker","year":"2005","unstructured":"Bekker, H., Braad, E.P., Goldengorin, B.: Using bipartite and multidimensional matching to select the roots of a system of polynomial equations. In: Gervasi, O., et al. (eds.) ICCSA 2005, Part IV. LNCS, vol. 3483, pp. 397\u2013406. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11424925_43"},{"key":"21_CR3","doi-asserted-by":"publisher","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning (2017). https:\/\/doi.org\/10.48550\/arXiv.1611.09940, arXiv:1611.09940 [cs, stat]","DOI":"10.48550\/arXiv.1611.09940"},{"issue":"6","key":"21_CR4","doi-asserted-by":"publisher","first-page":"1172","DOI":"10.1287\/opre.1060.0323","volume":"54","author":"A Ceselli","year":"2006","unstructured":"Ceselli, A., Righini, G.: A branch-and-price algorithm for the multilevel generalized assignment problem. Oper. Res. 54(6), 1172\u20131184 (2006)","journal-title":"Oper. Res."},{"issue":"6","key":"21_CR5","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","journal-title":"Oper. Res."},{"issue":"12","key":"21_CR6","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1109\/TASLP.2019.2935837","volume":"27","author":"X Dang","year":"2019","unstructured":"Dang, X., Cheng, Q., Zhu, H.: Indoor multiple sound source localization via multi-dimensional assignment data association. IEEE\/ACM Trans. Audio Speech Lang. Process. 27(12), 1944\u20131956 (2019). https:\/\/doi.org\/10.1109\/TASLP.2019.2935837","journal-title":"IEEE\/ACM Trans. Audio Speech Lang. Process."},{"key":"21_CR7","unstructured":"Feng, Y., You, H., Zhang, Z., Ji, R., Gao, Y.: Hypergraph neural networks. CoRR abs\/1809.09401 (2018). http:\/\/arxiv.org\/abs\/1809.09401"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1017900606269","volume":"8","author":"AP French","year":"2002","unstructured":"French, A.P., Wilson, J.M.: Heuristic solution methods for the multilevel generalized assignment problem. J. Heuristics 8, 143\u2013153 (2002)","journal-title":"J. Heuristics"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1057\/jors.1981.207","volume":"32","author":"A Frieze","year":"1981","unstructured":"Frieze, A., Yadegar, J.: An algorithm for solving 3-dimensional assignment problems with application to scheduling a teaching practice. J. Oper. Res. Soc. 32, 989\u2013995 (1981)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"21_CR10","doi-asserted-by":"crossref","first-page":"3181","DOI":"10.1109\/TPAMI.2022.3182052","volume":"45","author":"Y Gao","year":"2022","unstructured":"Gao, Y., Feng, Y., Ji, S., Ji, R.: HGNN+: general hypergraph neural networks. IEEE Trans. Pattern Anal. Mach. Intell. 45(3), 3181\u20133199 (2022)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"21_CR11","volume-title":"Computers and Intractability","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174. Freeman, San Francisco (1979)"},{"key":"21_CR12","doi-asserted-by":"publisher","unstructured":"Gibbons, D., Lim, C.C., Shi, P.: Deep learning for bipartite assignment problems. In: 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC), pp. 2318\u20132325 (2019). https:\/\/doi.org\/10.1109\/SMC.2019.8914228","DOI":"10.1109\/SMC.2019.8914228"},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1287\/inte.8.4.16","volume":"8","author":"F Glover","year":"1978","unstructured":"Glover, F., Hultz, J., Klingman, D.: Improved computer-based planning techniques, part 1. Interfaces 8(4), 16\u201325 (1978)","journal-title":"Interfaces"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/11970125_17","volume-title":"Approximation and Online Algorithms","author":"G Gutin","year":"2007","unstructured":"Gutin, G., Goldengorin, B., Huang, J.: Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, pp. 214\u2013225. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/11970125_17"},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. J. ACM (JACM) 23(2), 317\u2013327 (1976)","journal-title":"J. ACM (JACM)"},{"key":"21_CR16","unstructured":"Karapetyan, D., Gutin, G., Goldengorin, B.: Empirical evaluation of construction heuristics for the multidimensional assignment problem. arXiv preprint arXiv:0906.2960 (2009)"},{"key":"21_CR17","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)"},{"key":"21_CR18","doi-asserted-by":"publisher","unstructured":"Kool, W., van Hoof, H., Welling, M.: Attention, learn to solve routing problems! (2019). https:\/\/doi.org\/10.48550\/arXiv.1803.08475, arXiv:1803.08475 [cs, stat]","DOI":"10.48550\/arXiv.1803.08475"},{"issue":"2","key":"21_CR19","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"issue":"2","key":"21_CR20","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1287\/opre.16.2.422","volume":"16","author":"WP Pierskalla","year":"1968","unstructured":"Pierskalla, W.P.: The multidimensional assignment problem. Oper. Res. 16(2), 422\u2013431 (1968)","journal-title":"Oper. Res."},{"key":"21_CR21","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"2014","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, Hoboken (2014)"},{"key":"21_CR22","doi-asserted-by":"publisher","unstructured":"Rainjonneau, S., et al.: Quantum algorithms applied to satellite mission planning for earth observation. IEEE J. Sel. Top. Appl. Earth Observ. Remote Sens. 16, 7062\u20137075 (2023). https:\/\/doi.org\/10.1109\/jstars.2023.3287154, http:\/\/dx.doi.org\/10.1109\/JSTARS.2023.3287154","DOI":"10.1109\/jstars.2023.3287154"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-319-93417-4_38","volume-title":"The Semantic Web","author":"M Schlichtkrull","year":"2018","unstructured":"Schlichtkrull, M., Kipf, T.N., Bloem, P., van\u00a0den Berg, R., Titov, I., Welling, M.: Modeling relational data with graph convolutional networks. In: Gangemi, A., et al. (eds.) ESWC 2018. LNCS, vol. 10843, pp. 593\u2013607. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93417-4_38"},{"key":"21_CR24","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)"},{"issue":"3","key":"21_CR25","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/0377-2217(95)00003-8","volume":"91","author":"FC Spieksma","year":"1996","unstructured":"Spieksma, F.C., Woeginger, G.J.: Geometric three-dimensional assignment problems. Eur. J. Oper. Res. 91(3), 611\u2013618 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR26","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (2018)"},{"key":"21_CR27","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"21_CR28","doi-asserted-by":"publisher","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks (2017). https:\/\/doi.org\/10.48550\/arXiv.1506.03134, arXiv:1506.03134 [cs, stat]","DOI":"10.48550\/arXiv.1506.03134"},{"key":"21_CR29","doi-asserted-by":"publisher","first-page":"106010","DOI":"10.1016\/j.cor.2022.106010","volume":"149","author":"J Wang","year":"2023","unstructured":"Wang, J., Song, G., Liang, Z., Demeulemeester, E., Hu, X., Liu, J.: Unrelated parallel machine scheduling with multiple time windows: an application to earth observation satellite scheduling. Comput. Oper. Res. 149, 106010 (2023)","journal-title":"Comput. Oper. Res."},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Whitney, H.: A theorem on graphs. Ann. Math. 378\u2013390 (1931)","DOI":"10.2307\/1968197"},{"key":"21_CR31","doi-asserted-by":"publisher","unstructured":"Zhang, R., et al.: Learning to solve multiple-TSP with time window and rejections via deep reinforcement learning. IEEE Trans. Intell. Transp. Syst. 1\u201312 (2022). https:\/\/doi.org\/10.1109\/TITS.2022.3207011","DOI":"10.1109\/TITS.2022.3207011"}],"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-60599-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T02:21:40Z","timestamp":1732069300000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60599-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031606014","9783031605994"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60599-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 May 2024","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 the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}