{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T14:18:10Z","timestamp":1779373090074,"version":"3.53.1"},"reference-count":187,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Alma Mater Studiorum - Universit\u00e0 di Bologna"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Matheuristics are problem independent frameworks that use mathematical programming tools to obtain high quality heuristic solutions. They are structurally general enough to be applied to different problems with little adaptation to their abstract structure, so they can be considered as new or hybrid metaheuristics based on components derived from the mathematical model of the problems of interest. In this survey, we emphasize the mathematical tools and describe how they can be used to design heuristics. We focus on mixed-integer linear programming and report representative examples from the literature of how it has been used for effective heuristic optimization. References to contributions to matheuristics deriving from neighboring research areas such as Artificial Intelligence or Quantum Computing are also included. We conclude with some ideas for possible future developments. This paper extends an original version published in 4OR with new sections on CMSA, Incremental Core, AI hybrids and Quantum Heuristics, and includes references to several recent publications.<\/jats:p>","DOI":"10.1007\/s10479-024-06302-z","type":"journal-article","created":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T06:02:15Z","timestamp":1729576935000},"page":"663-700","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Contemporary approaches in matheuristics an updated survey"],"prefix":"10.1007","volume":"343","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8712-115X","authenticated-orcid":false,"given":"Marco Antonio","family":"Boschetti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vittorio","family":"Maniezzo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,10,22]]},"reference":[{"key":"6302_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104941","volume":"119","author":"B Abbasi","year":"2020","unstructured":"Abbasi, B., Babaei, T., Hosseinifard, Z., Smith-Miles, K., & Dehghani, M. (2020). Predicting solutions of large-scale optimization problems via machine learning: A case study in blood supply chain management. Computers & Operations Research, 119, 104941.","journal-title":"Computers & Operations Research"},{"key":"6302_CR2","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1057\/palgrave.jors.2600621","volume":"49","author":"M Agar","year":"1998","unstructured":"Agar, M., & Salhi, S. (1998). Lagrangean heuristics applied to a variety of large capacitated plant location problems. Journal of the Operational Research Society, 49, 1072\u20131084.","journal-title":"Journal of the Operational Research Society"},{"key":"6302_CR3","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1287\/opre.45.2.226","volume":"45","author":"C Aggarwal","year":"1997","unstructured":"Aggarwal, C., Orlin, J., & Tai, R. (1997). An optimized crossover for the maximum independent set. Operations Research, 45, 226\u2013234.","journal-title":"Operations Research"},{"key":"6302_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"RK Ahuja","year":"2002","unstructured":"Ahuja, R. K., Ergun, O., Orlin, J. B., & Punnen, A. P. A. (2002). Survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123, 75\u2013102.","journal-title":"Discrete Applied Mathematics"},{"key":"6302_CR5","unstructured":"Ahuja, R.K., Orlin, J.B., & Sharma, D. (1999). New neighborhood search structures for the capacitated minimum spanning tree problem. Technical Report 99-2, Department of Industrial and Systems Engineering, University of Florida."},{"issue":"4\u20135","key":"6302_CR6","first-page":"301","volume":"7","author":"RK Ahuja","year":"2000","unstructured":"Ahuja, R. K., Orlin, J. B., & Sharma, D. (2000). Very large-scale neighborhood search. International Transactions in Operational Research, 7(4\u20135), 301\u2013317.","journal-title":"International Transactions in Operational Research"},{"key":"6302_CR7","unstructured":"Angelelli, E., Mansini, R., & Speranza, M.G. (2007). Kernel search: a heuristic framework for MILP problems with binary variables. Technical report, Department of Electronics for Automation, University of Brescia, R.T.2007-04-56."},{"issue":"11","key":"6302_CR8","doi-asserted-by":"publisher","first-page":"2017","DOI":"10.1016\/j.cor.2010.02.002","volume":"37","author":"E Angelelli","year":"2010","unstructured":"Angelelli, E., Mansini, R., & Speranza, M. G. (2010). Kernel search: a general heuristic for the multi-dimensional knapsack problem. Computer and Operations Research, 37(11), 2017\u20132026.","journal-title":"Computer and Operations Research"},{"issue":"1","key":"6302_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10589-010-9326-6","volume":"51","author":"E Angelelli","year":"2012","unstructured":"Angelelli, E., Mansini, R., & Speranza, M. G. (2012). Kernel search: A new heuristic framework for portfolio selection. Computational Optimization and Applications, 51(1), 345\u2013361.","journal-title":"Computational Optimization and Applications"},{"key":"6302_CR10","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s10732-007-9025-3","volume":"13","author":"P Avella","year":"2007","unstructured":"Avella, P., D\u2019Auria, B., Salerno, S., & Vasil\u2019ev, I. (2007). A computational study of local search algorithms for Italian high-school timetabling. Journal of Heuristics, 13, 543\u2013556.","journal-title":"Journal of Heuristics"},{"key":"6302_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F Barahona","year":"2000","unstructured":"Barahona, F., & Anbil, R. (2000). The volume algorithm: Producing primal solutions with a subgradient method. Mathematical Programming, 87, 385\u2013399.","journal-title":"Mathematical Programming"},{"key":"6302_CR12","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/0377-2217(84)90211-X","volume":"15","author":"J Barcelo","year":"1984","unstructured":"Barcelo, J., & Casanova, J. (1984). A heuristic Lagrangean algorithm for the capacitated plant location problem. European Journal of Operational Research, 15, 212\u2013226.","journal-title":"European Journal of Operational Research"},{"key":"6302_CR13","doi-asserted-by":"crossref","unstructured":"Bartolini, E., Maniezzo, V., & Mingozzi, A. (2008). An adaptive memory-based approach based on partial enumeration. In: V.\u00a0Maniezzo, R.\u00a0Battiti, J.P. Watson (eds.) LION 2, LNCS 5313, pp. 12\u201324. Springer","DOI":"10.1007\/978-3-540-92695-5_2"},{"issue":"3","key":"6302_CR14","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10732-008-9091-1","volume":"15","author":"E Bartolini","year":"2009","unstructured":"Bartolini, E., & Mingozzi, A. (2009). Algorithms for the non-bifurcated network design problem. Joutnal of Heuristics, 15(3), 259\u2013281.","journal-title":"Joutnal of Heuristics"},{"key":"6302_CR15","volume-title":"Linear Programming and Network Flows","author":"MS Bazaraa","year":"1990","unstructured":"Bazaraa, M. S., Jarvis, J., & Sherali, H. D. (1990). Linear Programming and Network Flows. John Wiley & Sons."},{"key":"6302_CR16","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","volume":"65","author":"J Beasley","year":"1993","unstructured":"Beasley, J. (1993). Lagrangian heuristics for location problems. European Journal of Operational Research, 65, 383\u2013399.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6302_CR17","first-page":"277","volume":"5","author":"R Bellman","year":"1957","unstructured":"Bellman, R. (1957). Dynamic programming and the numerical solution of variational problems. Operations Research, 5(2), 277\u2013288.","journal-title":"Operations Research"},{"key":"6302_CR18","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4, 280\u2013322.","journal-title":"Numerische Mathematik"},{"issue":"1","key":"6302_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"HG Beyer","year":"2002","unstructured":"Beyer, H. G., & Schwefel, H. P. (2002). Evolution strategies - a comprehensive introduction. Natural Computing, 1(1), 3\u201352.","journal-title":"Natural Computing"},{"issue":"2","key":"6302_CR20","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.ejor.2022.04.009","volume":"304","author":"T Bigler","year":"2023","unstructured":"Bigler, T., Kammermann, M., & Baumann, P. (2023). A matheuristic for a customer assignment problem in direct marketing. European Journal of Operational Research, 304(2), 689\u2013708.","journal-title":"European Journal of Operational Research"},{"key":"6302_CR21","volume-title":"MIP: Theory andpractice - closing the gap","author":"RE Bixby","year":"2000","unstructured":"Bixby, R. E., Fenelon, M., Gu, Z., Rothberg, E., & Wunderling, R. (2000). MIP: Theory andpractice - closing the gap. Kluwer Academic Publishers."},{"issue":"6","key":"6302_CR22","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C Blum","year":"2005","unstructured":"Blum, C. (2005). Beam-ACO - hybridizing ant colony optimization with beam search: An application to open shop scheduling. Computers and Operations Research, 32(6), 1565\u20131591.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"6302_CR23","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1287\/ijoc.1080.0271","volume":"20","author":"C Blum","year":"2008","unstructured":"Blum, C. (2008). Beam-ACO for simple assembly line balancing. INFORMS Journal on Computing, 20(4), 618\u2013627.","journal-title":"INFORMS Journal on Computing"},{"key":"6302_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-60103-3","volume-title":"Construct, Merge. Solve & Adapt. Computational Intelligence Methods","author":"C Blum","year":"2024","unstructured":"Blum, C. (2024). Construct, Merge. Solve & Adapt. Computational Intelligence Methods. Cham: Springer."},{"key":"6302_CR25","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cor.2015.10.014","volume":"68","author":"C Blum","year":"2016","unstructured":"Blum, C., Pinacho, P., L\u00f3pez-Ib\u00e1\u00f1ez, M., & Lozano, J. A. (2016). Construct, merge, solve & adapt a new general algorithm for combinatorial optimization. Computers & Operations Research, 68, 75\u201388.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"6302_CR26","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/j.ejor.2022.10.023","volume":"307","author":"M Boccia","year":"2023","unstructured":"Boccia, M., Masone, A., Sterle, C., & Murino, T. (2023). The parallel agv scheduling problem with battery constraints: A new formulation and a matheuristic approach. European Journal of Operational Research, 307(2), 590\u2013603.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6302_CR27","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1016\/j.ejor.2007.06.060","volume":"195","author":"P Borisovsky","year":"2009","unstructured":"Borisovsky, P., Dolgui, A., & Eremeev, A. (2009). Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder. European Journal of Operational Research, 195(3), 770\u2013779.","journal-title":"European Journal of Operational Research"},{"key":"6302_CR28","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10732-007-9064-9","volume":"15","author":"M Boschetti","year":"2009","unstructured":"Boschetti, M., & Maniezzo, V. (2009). Benders decomposition, Lagrangean relaxation and metaheuristic design. Journal of Heuristics, 15, 283\u2013312.","journal-title":"Journal of Heuristics"},{"key":"6302_CR29","doi-asserted-by":"crossref","unstructured":"Boschetti, M., Maniezzo, V., & Roffilli, M. (2009). Decomposition techniques as metaheuristic frameworks. In: V.\u00a0Maniezzo, T.\u00a0St\u00fctzle, S.\u00a0Vo\u00df (eds.) Matheuristics. Annals of Information Systems, vol 10. Springer, Boston, MA","DOI":"10.1007\/978-1-4419-1306-7_5"},{"key":"6302_CR30","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.omega.2019.03.002","volume":"93","author":"MA Boschetti","year":"2020","unstructured":"Boschetti, M. A., Golfarelli, M., & Graziani, S. (2020). An exact method for shrinking pivot tables. Omega, 93, 10\u201344.","journal-title":"Omega"},{"issue":"6","key":"6302_CR31","doi-asserted-by":"publisher","first-page":"2840","DOI":"10.1111\/itor.13301","volume":"30","author":"MA Boschetti","year":"2023","unstructured":"Boschetti, M. A., Letchford, A. N., & Maniezzo, V. (2023). Matheuristics: Survey and synthesis. International Transactions in Operational Research, 30(6), 2840\u20132866.","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"6302_CR32","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10732-007-9064-9","volume":"15","author":"MA Boschetti","year":"2009","unstructured":"Boschetti, M. A., & Maniezzo, V. (2009). Benders decomposition, Lagrangian relaxation and metaheuristic design. Journal of Heuristics, 15(3), 283\u2013312.","journal-title":"Journal of Heuristics"},{"issue":"1","key":"6302_CR33","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1111\/itor.12110","volume":"22","author":"MA Boschetti","year":"2015","unstructured":"Boschetti, M. A., & Maniezzo, V. (2015). A set covering based matheuristic for a real-world city logistics problem. International Transactions in Operational Research, 22(1), 169\u2013195.","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"6302_CR34","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10288-022-00510-8","volume":"20","author":"MA Boschetti","year":"2022","unstructured":"Boschetti, M. A., & Maniezzo, V. (2022). Matheuristics: Using mathematics for heuristic design. 4OR, 20(2), 173\u2013208.","journal-title":"4OR"},{"issue":"1","key":"6302_CR35","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1287\/ijoc.1100.0381","volume":"23","author":"MA Boschetti","year":"2011","unstructured":"Boschetti, M. A., Maniezzo, V., & Roffilli, M. (2011). Fully distributed Lagrangian solution for a peer-to-peer overlay network design problem. INFORMS Journal on Computing, 23(1), 90\u2013104.","journal-title":"INFORMS Journal on Computing"},{"key":"6302_CR36","doi-asserted-by":"crossref","unstructured":"Boschetti, M.A., Maniezzo, V., Roffilli, M., & Boluf\u00e9\u00a0R\u00f6hler, A. (2009). Matheuristics: Optimization, simulation and control. In: M.\u00a0Blesa, C.\u00a0Blum, L.\u00a0Di\u00a0Gaspero, A.\u00a0Roli, M.\u00a0Sampels, A.\u00a0Schaerf (eds.) Hybrid Metaheuristics, HM 2009. Lecture Notes in Computer Science, vol 5818, Springer","DOI":"10.1007\/978-3-642-04918-7_13"},{"key":"6302_CR37","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.jpdc.2018.07.009","volume":"133","author":"MA Boschetti","year":"2019","unstructured":"Boschetti, M. A., Maniezzo, V., & Strappaveccia, F. (2019). Membership overlay design optimization with resource constraints (accelerated on gpu). Journal of Parallel and Distributed Computing, 133, 286\u2013296.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"6302_CR38","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1023\/B:ANOR.0000019089.86834.91","volume":"127","author":"MA Boschetti","year":"2004","unstructured":"Boschetti, M. A., Mingozzi, A., & Ricciardelli, S. (2004). An exact algorithm for the simplified multi depot crew scheduling problem. Annals of Operations Research, 127, 177\u2013201.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"6302_CR39","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1016\/j.disopt.2008.06.001","volume":"5","author":"MA Boschetti","year":"2008","unstructured":"Boschetti, M. A., Mingozzi, A., & Ricciardelli, S. (2008). A dual ascent procedure for the set partitioning problem. Discrete Optimization, 5(4), 735\u2013747.","journal-title":"Discrete Optimization"},{"issue":"3","key":"6302_CR40","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.ejor.2007.06.068","volume":"199","author":"V Boyer","year":"2009","unstructured":"Boyer, V., Elkihel, M., & El Baz, D. (2009). Heuristics for the 0\u20131 multidimensional knapsack problem. European Journal of Operational Research, 199(3), 658\u2013664.","journal-title":"European Journal of Operational Research"},{"key":"6302_CR41","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s00291-006-0052-5","volume":"29","author":"T Brueggemann","year":"2007","unstructured":"Brueggemann, T., & Hurink, J. L. (2007). Two exponential neighborhoods for single machine scheduling. OR Spectrum, 29, 513\u2013533.","journal-title":"OR Spectrum"},{"issue":"6","key":"6302_CR42","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s10732-010-9149-8","volume":"17","author":"T Brueggemann","year":"2011","unstructured":"Brueggemann, T., & Hurink, J. L. (2011). Matching based very large-scale neighborhoods for parallel machine scheduling. Journal of Heuristics, 17(6), 637\u2013658.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"6302_CR43","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s42484-023-00119-y","volume":"5","author":"R Campos","year":"2023","unstructured":"Campos, R., Casares, P. A. M., & Martin-Delgado, M. A. (2023). Quantum Metropolis Solver: A quantum walks approach to optimization problems. Quantum Machine Intelligence, 5(2), 28. https:\/\/doi.org\/10.1007\/s42484-023-00119-y","journal-title":"Quantum Machine Intelligence"},{"key":"6302_CR44","doi-asserted-by":"crossref","unstructured":"Caserta, M., Ramirez, A., & Vo\u00df, S. (2010). A math-heuristic for the multi-level capacitated lot sizing problem with carryover. In: C.D. Chio, et\u00a0al. (eds.) Applications of Evolutionary Computation. EvoApplications 2010. Lecture Notes in Computer Science, vol 6025, pp. 462\u2013471. Springer","DOI":"10.1007\/978-3-642-12242-2_47"},{"key":"6302_CR45","doi-asserted-by":"crossref","unstructured":"Caserta, M., & Vo\u00df, S. (2009). A cooperative strategy for guiding the corridor method. In: N.\u00a0Krasnogor, et\u00a0al. (eds.) Nature Inspired Cooperative Strategies for Optimization (NICSO 2008). Studies in Computational Intelligence, vol 236. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-03211-0_23"},{"key":"6302_CR46","doi-asserted-by":"crossref","unstructured":"Caserta, M., & Vo\u00df, S. (2009). Corridor selection and fine tuning for the corridor method. In: T.\u00a0St\u00fctzle (ed.) Learning and Intelligent Optimization. LION 2009. Lecture Notes in Computer Science, vol 5851. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-11169-3_12"},{"key":"6302_CR47","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.dam.2012.08.025","volume":"163","author":"M Caserta","year":"2014","unstructured":"Caserta, M., & Vo\u00df, S. (2014). A hybrid algorithm for the DNA sequencing problem. Discrete Applied Mathematics, 163, 87\u201399.","journal-title":"Discrete Applied Mathematics"},{"key":"6302_CR48","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/s00291-009-0176-5","volume":"33","author":"M Caserta","year":"2011","unstructured":"Caserta, M., Vo\u00df, S., & Sniedovich, M. (2011). Applying the corridor method to a blocks relocation problem. Operations Research Spektrum, 33, 915\u2013929.","journal-title":"Operations Research Spektrum"},{"issue":"9","key":"6302_CR49","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1038\/s42254-021-00348-9","volume":"3","author":"M Cerezo","year":"2021","unstructured":"Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., & Coles, P. J. (2021). Variational quantum algorithms. Nature Reviews Physics, 3(9), 625\u2013644. https:\/\/doi.org\/10.1038\/s42254-021-00348-9","journal-title":"Nature Reviews Physics"},{"issue":"9","key":"6302_CR50","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1007\/s00500-013-1203-7","volume":"18","author":"HP Chiang","year":"2014","unstructured":"Chiang, H. P., Chou, Y. H., Chiu, C. H., Kuo, S. Y., & Huang, Y. M. (2014). A quantum-inspired tabu search algorithm for solving combinatorial optimization problems. Soft Computing, 18(9), 1771\u20131781. https:\/\/doi.org\/10.1007\/s00500-013-1203-7","journal-title":"Soft Computing"},{"key":"6302_CR51","doi-asserted-by":"crossref","unstructured":"Chiarandini, M., Dumitrescu, I., & St\u00fctzle, T. (2008). Very large-scale neighborhood search: Overview and case studies on coloring problems. In: C.\u00a0Blum, M.J. Blesa, A.\u00a0Roli, M.\u00a0Sampels (eds.) Hybrid Metaheuristics, vol. 114 of Studies in Computational Intelligence, pp. 117\u2013150. Springer","DOI":"10.1007\/978-3-540-78295-7_5"},{"issue":"2","key":"6302_CR52","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/net.3230110207","volume":"11","author":"N Christofides","year":"1981","unstructured":"Christofides, N., Mingozzi, A., & Toth, P. (1981). State-space relaxation procedures for the computation of bounds to routing problems. Networks, 11(2), 145\u2013164.","journal-title":"Networks"},{"key":"6302_CR53","doi-asserted-by":"crossref","unstructured":"Codato, G., & Fischetti, M. (2004). Combinatorial benders\u2019 cuts. In D. Bienstock & G. Nemhauser (Eds.), Integer Programming and Combinatorial Optimization (pp. 178\u2013195). Berlin Heidelberg, Berlin, Heidelberg: Springer.","DOI":"10.1007\/978-3-540-25960-2_14"},{"key":"6302_CR54","unstructured":"Colorni, A., Dorigo, M., & Maniezzo, V. (1991). Distributed optimization by ant colonies. In: F.\u00a0Varela, P.\u00a0Bourgine (eds.) Proceedings of the European Conference on Artificial Life, ECAL\u201991, Paris, pp. 134\u2013142. Elsevier Publishing, Amsterdam"},{"issue":"1","key":"6302_CR55","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"RK Congram","year":"2002","unstructured":"Congram, R. K., Potts, C. N., & van de Velde, S. (2002). An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 14(1), 52\u201367.","journal-title":"INFORMS Journal on Computing"},{"key":"6302_CR56","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10732-005-2634-9","volume":"11","author":"CB Cunha","year":"2005","unstructured":"Cunha, C. B., & Ahuja, R. K. (2005). Very large scale neighborhood search for the k-constrained multiple knapsack problem. Journal of Heuristics, 11, 465\u2013481.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"6302_CR57","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1016\/j.ejor.2020.09.050","volume":"291","author":"QV Dang","year":"2021","unstructured":"Dang, Q. V., van Diessen, T., Martagan, T., & Adan, I. (2021). A matheuristic for parallel machine scheduling with tool replacements. European Journal of Operational Research, 291(2), 640\u2013660.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"6302_CR58","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., & Pape, C. (2005). Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming, 102(1), 71\u201390.","journal-title":"Mathematical Programming"},{"key":"6302_CR59","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8, 101\u2013111.","journal-title":"Operations Research"},{"key":"6302_CR60","doi-asserted-by":"crossref","unstructured":"De\u00a0Franceschi, R., Fischetti, M., & Toth, P. (2006). A new ilp-based refinement heuristic for vehicle routing problems. Mathematical Programming B(105 (2-3)), 471-499","DOI":"10.1007\/s10107-005-0662-8"},{"issue":"1","key":"6302_CR61","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:HEUR.0000019987.10818.e0","volume":"10","author":"F Della Croce","year":"2004","unstructured":"Della Croce, F., Ghirardi, M., & Tadei, R. (2004). Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems. Journal of Heuristics, 10(1), 89\u2013104.","journal-title":"Journal of Heuristics"},{"key":"6302_CR62","doi-asserted-by":"crossref","unstructured":"D.F., R., Viana, A., Pedroso. J. (2014). Metaheuristic search based methods for unit commitment. International Journal of Electrical Power and Energy Systems, 59, 14\u201322.","DOI":"10.1016\/j.ijepes.2014.01.038"},{"issue":"4","key":"6302_CR63","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.orl.2021.05.011","volume":"49","author":"T Dokka","year":"2021","unstructured":"Dokka, T., Letchford, A., & Mansoor, M. (2021). On the complexity of surrogate and group relaxation for integer linear programs. Operations Research Letters, 49(4), 530\u2013534.","journal-title":"Operations Research Letters"},{"key":"6302_CR64","doi-asserted-by":"crossref","unstructured":"Dokka, T., Letchford, A., & Mansoor, M. (2021). Revisiting surrogate relaxation for the multi-dimensional knapsack problem. Submitted to Operations Research Letters","DOI":"10.1016\/j.orl.2022.10.003"},{"key":"6302_CR65","doi-asserted-by":"crossref","unstructured":"Dolgui, A., Eremeev, A., & Guschinskaya, O. (2010). MIP-based GRASP and genetic algorithm for balancing transfer lines. In: Matheuristics, p. 189-208","DOI":"10.1007\/978-1-4419-1306-7_7"},{"issue":"1","key":"6302_CR66","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 26(1), 29\u201341.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"},{"key":"6302_CR67","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., & St\u00fctzle, T. (2004). Ant Colony Optimization. Cambridge, MA: MIT Press."},{"key":"6302_CR68","doi-asserted-by":"publisher","unstructured":"Du, Y., Wang, H., Hennig, R., Hulandageri, A., Kochenberger, G., & Glover, F. (2023). New advances for quantum-inspired optimization. International Transactions in Operational Research n\/a(n\/a). https:\/\/doi.org\/10.1111\/itor.13420.","DOI":"10.1111\/itor.13420"},{"key":"6302_CR69","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","volume":"34","author":"C Duin","year":"1999","unstructured":"Duin, C., & Vo\u00df, S. (1999). The pilot method: A strategy for heurisic repetition with application problem in graphs. Networks, 34, 181\u2013191.","journal-title":"Networks"},{"issue":"45","key":"6302_CR70","doi-asserted-by":"publisher","first-page":"eadi0487","DOI":"10.1126\/sciadv.adi0487","volume":"9","author":"M Dupont","year":"2023","unstructured":"Dupont, M., Evert, B., Hodson, M. J., Sundar, B., Jeffrey, S., Yamaguchi, Y., Feng, D., Maciejewski, F. B., Hadfield, S., Alam, M. S., Wang, Z., Grabbe, S., Lott, P. A., Rieffel, E. G., Venturelli, D., & Reagor, M. J. (2023). Quantum-enhanced greedy combinatorial optimization solver. Science Advances, 9(45), eadi0487. https:\/\/doi.org\/10.1126\/sciadv.adi0487","journal-title":"Science Advances"},{"key":"6302_CR71","doi-asserted-by":"crossref","unstructured":"D\u2019Andreagiovanni, F.A. (2014). Hybrid exact-ACO algorithm for the joint scheduling, power and cluster assignment in cooperative wireless networks. In: G.\u00a0Di\u00a0Caro, G.\u00a0Theraulaz (eds.) Bio-Inspired Models of Network, Information, and Computing Systems, pp. 3\u201317. Springer","DOI":"10.1007\/978-3-319-06944-9_1"},{"key":"6302_CR72","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.106129","volume":"152","author":"Emilio J Alarcon","year":"2023","unstructured":"Alarcon, Emilio J., & Ortega, K. F. D. (2023). A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows. Computers & Operations Research, 152, 106129.","journal-title":"Computers & Operations Research"},{"issue":"1\u20132","key":"6302_CR73","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10732-006-5561-5","volume":"12","author":"O Ergun","year":"2006","unstructured":"Ergun, O., Orlin, J. B., & Steele-Feldman, A. (2006). Creating very large scale neighborhoods out of smaller ones by compounding moves. Journal of Heuristics, 12(1\u20132), 115\u2013140.","journal-title":"Journal of Heuristics"},{"issue":"5516","key":"6302_CR74","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1126\/science.1057726","volume":"292","author":"E Farhi","year":"2001","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001). A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem. Science, 292(5516), 472\u2013475. https:\/\/doi.org\/10.1126\/science.1057726","journal-title":"Science"},{"key":"6302_CR75","doi-asserted-by":"crossref","unstructured":"Ferone, D., Festa, P., Fugaro, S., & Pastore, T. (2023). Hybridizing a matheuristic with alns for the optimal collection and delivery of medical specimens. International Transactions in Operational Research n\/a(n\/a), 1\u201327","DOI":"10.1111\/itor.13386"},{"key":"6302_CR76","doi-asserted-by":"crossref","unstructured":"Fischetti, M., & Fischetti, M. (2018). Matheuristics. In: Handbook of Heuristics, vol. 1-2, pp. 121\u2013153. Springer","DOI":"10.1007\/978-3-319-07124-4_14"},{"issue":"1","key":"6302_CR77","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., & Lodi, A. (2005). The feasibility pump. Mathematical Programming, 104(1), 91\u2013104.","journal-title":"Mathematical Programming"},{"issue":"1\u20133","key":"6302_CR78","first-page":"23","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., & Lodi, A. (2003). Mathematical Programming. Ser. B. Local branching, 98(1\u20133), 23\u201347.","journal-title":"Local branching"},{"key":"6302_CR79","volume-title":"Matheuristics, Hybridizing Metaheuristics and Mathematical Programming, Annals of Information Systems","author":"M Fischetti","year":"2009","unstructured":"Fischetti, M., Lodi, A., & Salvagnin, D. (2009). Just mip it! In V. Maniezzo, T. St\u00fctzle, & S. Voss (Eds.), Matheuristics, Hybridizing Metaheuristics and Mathematical Programming, Annals of Information Systems.  (Vol. 10). Boston, MA: Springer."},{"key":"6302_CR80","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/opre.37.2.319","volume":"37","author":"M Fischetti","year":"1989","unstructured":"Fischetti, M., & Toth, P. (1989). An additive bounding procedure for combinatorial optimization problems. Operation Research, 37, 319\u2013328.","journal-title":"Operation Research"},{"issue":"9","key":"6302_CR81","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","volume":"32","author":"ML Fisher","year":"1986","unstructured":"Fisher, M. L., Jaikumar, R., & Van Wassenhove, L. N. (1986). A multiplier adjustment method for the generalized assignment problem. Management Science, 32(9), 1095\u20131103.","journal-title":"Management Science"},{"key":"6302_CR82","doi-asserted-by":"crossref","unstructured":"Flushing, E.F., & Di\u00a0Caro, G.A. (2012). Exploiting synergies between exact and heuristic methods in optimization: an application to the relay placement problem in wireless sensor networks. In: G.\u00a0Di\u00a0Caro, G.\u00a0Theraulaz (eds.) BIONETICS 2012, Lecture Notes for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 134, pp. 250\u2013265","DOI":"10.1007\/978-3-319-06944-9_18"},{"key":"6302_CR83","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.cor.2016.04.016","volume":"74","author":"GH Fonseca","year":"2016","unstructured":"Fonseca, G. H., Santos, H. G., & Carrano, E. G. (2016). Integrating matheuristics and metaheuristics for timetabling. Computers & Operations Research, 74, 108\u2013117.","journal-title":"Computers & Operations Research"},{"key":"6302_CR84","unstructured":"Gandibleux, X., & Hanafi, S. (2024). A primal matheuristic for multi-objective binary linear optimization problems. In: Metaheuristics, proceedings MIC 2024 conference. Lorient (France)"},{"key":"6302_CR85","doi-asserted-by":"publisher","unstructured":"Gemeinhardt, F., Garmendia, A., Wimmer, M., Weder, B., & Leymann, F. (2023). Quantum combinatorial optimization in the nisq era: A systematic mapping study. ACM Computer Survery 56(3). https:\/\/doi.org\/10.1145\/3620668.","DOI":"10.1145\/3620668"},{"key":"6302_CR86","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.trc.2006.03.002","volume":"14","author":"M Gendreau","year":"2006","unstructured":"Gendreau, M., Guertin, F., Potvin, J. Y., & Seguin, R. (2006). Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research Part C Emerging Technologies, 14, 157\u2013174.","journal-title":"Transportation Research Part C Emerging Technologies"},{"issue":"12","key":"6302_CR87","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.ifacol.2016.07.560","volume":"49","author":"B Gendron","year":"2016","unstructured":"Gendron, B., Hanafi, S., & Todosijevi\u0107, R. (2016). An efficient matheuristic for the multicommodity fixed-charge network design problem. IFAC-PapersOnLine, 49(12), 117\u2013120.","journal-title":"IFAC-PapersOnLine"},{"key":"6302_CR88","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1287\/opre.13.6.879","volume":"13","author":"F Glover","year":"1965","unstructured":"Glover, F. (1965). A multiphase-dual algorithm for the zero-one integer programming problem. Operations Research, 13, 879\u2013919.","journal-title":"Operations Research"},{"key":"6302_CR89","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1287\/opre.16.4.741","volume":"16","author":"F Glover","year":"1968","unstructured":"Glover, F. (1968). Surrogate constraints. Operations Research, 16, 741\u2013749.","journal-title":"Operations Research"},{"key":"6302_CR90","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1287\/opre.23.3.434","volume":"23","author":"F Glover","year":"1975","unstructured":"Glover, F. (1975). Surrogate constraint duality in mathematical programming. Operations Research, 23, 434\u2013451.","journal-title":"Operations Research"},{"issue":"1","key":"6302_CR91","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1), 156\u201316.","journal-title":"Decision Sciences"},{"issue":"3","key":"6302_CR92","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F. (1989). Tabu search - part I. ORSA Journal on Computing, 1(3), 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"6302_CR93","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover, F. (1990). Tabu search - part II. ORSA Journal on Computing, 2(1), 14\u201332.","journal-title":"ORSA Journal on Computing"},{"issue":"4","key":"6302_CR94","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10288-019-00424-y","volume":"17","author":"F Glover","year":"2019","unstructured":"Glover, F., Kochenberger, G., & Du, Y. (2019). Quantum bridge analytics i a tutorial on formulating and using qubo models. 4OR, 17(4), 335\u2013371. https:\/\/doi.org\/10.1007\/s10288-019-00424-y","journal-title":"4OR"},{"issue":"1","key":"6302_CR95","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10479-022-04634-2","volume":"314","author":"F Glover","year":"2022","unstructured":"Glover, F., Kochenberger, G., Hennig, R., & Du, Y. (2022). Quantum bridge analytics i: a tutorial on formulating and using qubo models. Annals of Operations Research, 314(1), 141\u2013183. https:\/\/doi.org\/10.1007\/s10479-022-04634-2","journal-title":"Annals of Operations Research"},{"key":"6302_CR96","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105304","volume":"132","author":"M Gn\u00e4gi","year":"2021","unstructured":"Gn\u00e4gi, M., & Baumann, P. (2021). A matheuristic for large-scale capacitated clustering. Computers & Operations Research, 132, 105304.","journal-title":"Computers & Operations Research"},{"key":"6302_CR97","volume-title":"Genetic Algorithms in Search","author":"D Goldberg","year":"1989","unstructured":"Goldberg, D. (1989). Genetic Algorithms in Search. Reading, USA: Optimization and Machine Learning. Addison-Wesley Professional."},{"key":"6302_CR98","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1287\/opre.18.5.924","volume":"18","author":"HJ Greenberg","year":"1970","unstructured":"Greenberg, H. J., & Pierskalla, W. P. (1970). Surrogate mathematical programming. Operations Research, 18, 924\u2013939.","journal-title":"Operations Research"},{"key":"6302_CR99","doi-asserted-by":"publisher","first-page":"2590","DOI":"10.1016\/j.cor.2005.07.006","volume":"33","author":"P Greistorfer","year":"2006","unstructured":"Greistorfer, P., & Rego, C. (2006). A simple filter-and-fan approach to the facility location problem. Computers & Operations Research, 33, 2590\u20132601.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"6302_CR100","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ejor.2011.09.004","volume":"217","author":"G Guastaroba","year":"2012","unstructured":"Guastaroba, G., & Speranza, M. G. (2012). Kernel search: an application to the index tracking problem. European Journal of Operational Research, 217(1), 54\u201368.","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"6302_CR101","doi-asserted-by":"publisher","first-page":"3074","DOI":"10.1016\/j.cor.2012.03.011","volume":"39","author":"A Gunawan","year":"2012","unstructured":"Gunawan, A., Ming Ng, K., & Leng Poh, K. (2012). A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem. Computers & Operations Research, 39(12), 3074\u20133088.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"6302_CR102","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1109\/TEVC.2002.804320","volume":"6","author":"KH Han","year":"2002","unstructured":"Han, K. H., & Kim, J. H. (2002). Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Transactions on Evolutionary Computation, 6(6), 580\u2013593. https:\/\/doi.org\/10.1109\/TEVC.2002.804320","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6302_CR103","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2024.104516","volume":"160","author":"P He","year":"2024","unstructured":"He, P., Jin, J. G., Tr\u00e9panier, M., & Schulte, F. (2024). A column-generation matheuristic approach for optimizing first-mile ridesharing services with publicly- and privately-owned autonomous vehicles. Transportation Research Part C: Emerging Technologies, 160, 104516.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"2","key":"6302_CR104","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.ejor.2023.03.038","volume":"310","author":"X He","year":"2023","unstructured":"He, X., Pan, Q. K., Gao, L., & Neufeld, J. S. (2023). An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem. European Journal of Operational Research, 310(2), 597\u2013610.","journal-title":"European Journal of Operational Research"},{"key":"6302_CR105","doi-asserted-by":"publisher","first-page":"120106","DOI":"10.1109\/ACCESS.2022.3218908","volume":"10","author":"S Heng","year":"2022","unstructured":"Heng, S., Kim, D., Kim, T., & Han, Y. (2022). How to solve combinatorial optimization problems using real quantum machines: A recent survey. IEEE Access, 10, 120106\u2013120121. https:\/\/doi.org\/10.1109\/ACCESS.2022.3218908","journal-title":"IEEE Access"},{"issue":"2","key":"6302_CR106","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1287\/ijoc.1090.0348","volume":"22","author":"M Hewitt","year":"2010","unstructured":"Hewitt, M., Nemhauser, G. L., & Savelsbergh, M. W. P. (2010). Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS Journal on Computing, 22(2), 314\u2013325.","journal-title":"INFORMS Journal on Computing"},{"key":"6302_CR107","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.B., & Lemarechal, C. (1993). Convex analysis and minimization algorithms II: Advanced theory and bundle methods. A Series of Comprehensive Studies in Mathematics 306","DOI":"10.1007\/978-3-662-06409-2"},{"key":"6302_CR108","volume-title":"Adaptation in Natural and Artificial Systems","author":"JH Holland","year":"1975","unstructured":"Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. Cambridge: MIT Press."},{"issue":"1","key":"6302_CR109","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0377-2217(96)00058-6","volume":"97","author":"K Holmberg","year":"1997","unstructured":"Holmberg, K., & Ling, J. (1997). A lagrangean heuristic for the facility location problem with staircase costs. European Journal of Operational Research, 97(1), 63\u201374.","journal-title":"European Journal of Operational Research"},{"key":"6302_CR110","volume-title":"Stochastic Local Search-Foundations and Applications","author":"H Hoos","year":"2004","unstructured":"Hoos, H., & St\u00fctzle, T. (2004). Stochastic Local Search-Foundations and Applications. San Francisco, CA, USA: Morgan Kaufmann."},{"issue":"5","key":"6302_CR111","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10732-007-9047-x","volume":"14","author":"B Hu","year":"2008","unstructured":"Hu, B., Leitner, M., & Raidl, G. R. (2008). Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. Journal of Heuristics, 14(5), 473\u2013499.","journal-title":"Journal of Heuristics"},{"key":"6302_CR112","unstructured":"Hu, B., & Raidl, G.R. (2006). Variable neighborhood descent with self-adaptive neighborhood ordering. In: Proceedings of the 7th EU\/ME meeting on Adaptive, Self-Adaptive and Multi-Level Metaheuristics"},{"key":"6302_CR113","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1007\/s10479-021-04142-9","volume":"320","author":"AA Juan","year":"2023","unstructured":"Juan, A. A., Keenan, P., Mart\u00ed, R., Javier Panadero, S. M., Carroll, P., & Oliva, D. (2023). A review of the role of heuristics in stochastic optimisation: From metaheuristics to learnheuristics. Annals of Operations Research, 320, 831\u2013861.","journal-title":"Annals of Operations Research"},{"key":"6302_CR114","doi-asserted-by":"publisher","unstructured":"Kadian, K., Garhwal, S., & Kumar, A. (2021). Quantum walk and its application domains: A systematic review. Computer Science Review, 41, 100419. https:\/\/doi.org\/10.1016\/j.cosrev.2021.100419 . https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1574013721000599","DOI":"10.1016\/j.cosrev.2021.100419"},{"key":"6302_CR115","first-page":"1942","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In: Proceedings of ICNN\u201995 - International Conference on Neural Networks, 4, 1942\u20131948.","journal-title":"In: Proceedings of ICNN\u201995 - International Conference on Neural Networks"},{"key":"6302_CR116","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C., & Vecchi, M. (1983). Optimization by simulated annealing. Science, 220, 671\u2013680.","journal-title":"Science"},{"key":"6302_CR117","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2024.110113","volume":"191","author":"O Kweon","year":"2024","unstructured":"Kweon, O., Kim, B. I., Lee, G., Im, H., Chung, C. Y., & Lim, O. K. (2024). Parcel delivery network optimization problem considering multiple hubs and consolidation of small-sized parcels. Computers & Industrial Engineering, 191, 110113.","journal-title":"Computers & Industrial Engineering"},{"key":"6302_CR118","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1007\/s11081-021-09629-9","volume":"23","author":"A Lamghari","year":"2022","unstructured":"Lamghari, A., Dimitrakopoulos, R., & Sen\u00e9cal, R. (2022). A matheuristic approach for optimizing mineral value chains under uncertainty. Optimization and Engineering, 23, 1139\u20131164.","journal-title":"Optimization and Engineering"},{"key":"6302_CR119","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2024.104522","volume":"160","author":"J Lehmann","year":"2024","unstructured":"Lehmann, J., & Winkenbach, M. (2024). A matheuristic for the two-echelon multi-trip vehicle routing problem with mixed pickup and delivery demand and time windows. Transportation Research Part C: Emerging Technologies, 160, 104522.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"6539","key":"6302_CR120","doi-asserted-by":"publisher","first-page":"2823","DOI":"10.1126\/science.abb2823","volume":"372","author":"NP de Leon","year":"2021","unstructured":"de Leon, N. P., Itoh, K. M., Kim, D., Mehta, K. K., Northup, T. E., Paik, H., Palmer, B. S., Samarth, N., Sangtawesin, S., & Steuerman, D. W. (2021). Materials challenges and opportunities for quantum computing hardware. Science, 372(6539), 2823. https:\/\/doi.org\/10.1126\/science.abb2823","journal-title":"Science"},{"key":"6302_CR121","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1111\/itor.12063","volume":"22","author":"R Lopes","year":"2015","unstructured":"Lopes, R., Morais, V. W., Noronha, T. F., & Souza, V. (2015). Heuristics and matheuristics for a real-life machine reassignment problem. International Transactions in Operational Research, 22, 77\u201395.","journal-title":"International Transactions in Operational Research"},{"issue":"1","key":"6302_CR122","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0377-2217(94)90401-4","volume":"79","author":"L Lorena","year":"1994","unstructured":"Lorena, L., & Belo Lopes, F. (1994). A surrogate heuristic for set covering problems. European Journal of Operational Research, 79(1), 138\u2013150.","journal-title":"European Journal of Operational Research"},{"key":"6302_CR123","unstructured":"Louren\u00e7o, H.R., Martin, O., & St\u00fctzle, T. (2002). Iterated local search. In: F.\u00a0Glover, G.\u00a0Kochenberger (eds.) Handbook of Metaheuristics, International Series in Operations Research & Management Science, pp. 321\u2013353. Kluwer Academic Publishers"},{"key":"6302_CR124","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, H.R., Martin, O., & St\u00fctzle, T. (2010). Iterated local search: Framework and applications. Handbook of Metaheuristics, 2nd. Edition., International Series in Operations Research and Management Science 146, 363-397. Kluwer Academic Publishers","DOI":"10.1007\/978-1-4419-1665-5_12"},{"key":"6302_CR125","unstructured":"Lowerre, B. (1976). The HARPY speech recognition system. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA"},{"issue":"4","key":"6302_CR126","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1287\/ijoc.11.4.358","volume":"11","author":"V Maniezzo","year":"1999","unstructured":"Maniezzo, V. (1999). Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal on Computing, 11(4), 358\u2013369.","journal-title":"INFORMS Journal on Computing"},{"key":"6302_CR127","unstructured":"Maniezzo, V. (2006). Matheuristics 2006 conference web portal. http:\/\/astarte.csr.unibo.it\/Matheuristics2006\/. Conference url"},{"key":"6302_CR128","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102336","author":"V Maniezzo","year":"2020","unstructured":"Maniezzo, V., Boschetti, M., & Gutjahr, W. (2020). Stochastic premarshalling of block stacking warehouses. Omega. https:\/\/doi.org\/10.1016\/j.omega.2020.102336","journal-title":"Omega"},{"key":"6302_CR129","doi-asserted-by":"crossref","unstructured":"Maniezzo, V., Boschetti, M., & Stuezle, T. (2021). Matheuristics: Algorithms and Implementations. EURO Advanced Tutorials on Operational Research: Springer International Publishing.","DOI":"10.1007\/978-3-030-70277-9"},{"key":"6302_CR130","doi-asserted-by":"crossref","unstructured":"Maniezzo, V., & St\u00fctzle, T. (2020). (eds): Special issue: Matheuristics and metaheuristics. International Transactions in Operational Research 27, 1","DOI":"10.1111\/itor.12702"},{"key":"6302_CR131","doi-asserted-by":"crossref","unstructured":"Maniezzo, V., St\u00fctzle, T., & Vo\u00df, S. (2009). Matheuristics: Hybridizing metaheuristics and mathematical programming. Annals of Information Systems 10","DOI":"10.1007\/978-1-4419-1306-7"},{"key":"6302_CR132","doi-asserted-by":"crossref","unstructured":"Maniezzo, V., & Zhou, T. (2023). Learning individualized hyperparameter settings. Algorithms 16(6)","DOI":"10.3390\/a16060267"},{"issue":"6","key":"6302_CR133","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953). Equation of state calculations by fast computing machines. The Journal of Chemical Physics, 21(6), 1087\u20131092.","journal-title":"The Journal of Chemical Physics"},{"key":"6302_CR134","doi-asserted-by":"crossref","unstructured":"Meyers, C., & Orlin, J.B. (2006). Very large-scale neighborhood search techniques in timetabling problems. In: E.K. Burke, H.\u00a0Rudov\u00e1 (eds.) Proceedings of the 6th international conference on practice and theory of automated timetabling VI (PATAT\u201906), pp. 24\u201339. Springer-Verlag, Berlin, Heidelberg","DOI":"10.1007\/978-3-540-77345-0_2"},{"key":"6302_CR135","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1287\/opre.47.6.873","volume":"47","author":"A Mingozzi","year":"1999","unstructured":"Mingozzi, A., Boschetti, M. A., Ricciardelli, S., & Bianco, L. A. (1999). Set partitioning approach to the crew scheduling problem. Operations Research, 47, 873\u2013888.","journal-title":"Operations Research"},{"key":"6302_CR136","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A Mingozzi","year":"1998","unstructured":"Mingozzi, A., Maniezzo, V., Ricciardelli, S., & Bianco, L. (1998). An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Management Science, 44, 714\u2013729.","journal-title":"Management Science"},{"issue":"5","key":"6302_CR137","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1080\/09720502.2008.10700590","volume":"11","author":"S Mitrovi\u0107-Mini\u0107","year":"2008","unstructured":"Mitrovi\u0107-Mini\u0107, S., & Punnen, A. P. (2008). Very large-scale variable neighborhood search for the generalized assignment problem. Journal of Interdisciplinary Mathematics, 11(5), 653\u2013670.","journal-title":"Journal of Interdisciplinary Mathematics"},{"key":"6302_CR138","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-1-4419-1306-7_10","volume-title":"Matheuristics: Hybridizing metaheuristics and mathematical programming, Annals of Information Systems","author":"S Mitrovi\u0107-Mini\u0107","year":"2009","unstructured":"Mitrovi\u0107-Mini\u0107, S., & Punnen, A. P. (2009). Variable intensity local search. In V. Maniezzo, T. St\u00fctzle, & S. Vo\u00df (Eds.), Matheuristics: Hybridizing metaheuristics and mathematical programming, Annals of Information Systems (Vol. 10, pp. 245\u2013252). US, Boston, MA: Springer."},{"issue":"11","key":"6302_CR139","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic, N., & Hansen, P. (1997). Variable neighborhood search. Computers and Operations Research, 24(11), 1097\u20131100.","journal-title":"Computers and Operations Research"},{"issue":"6","key":"6302_CR140","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1038\/s42254-022-00440-8","volume":"4","author":"N Mohseni","year":"2022","unstructured":"Mohseni, N., McMahon, P. L., & Byrnes, T. (2022). Ising machines as hardware solvers of combinatorial optimization problems. Nature Reviews Physics, 4(6), 363\u2013379. https:\/\/doi.org\/10.1038\/s42254-022-00440-8","journal-title":"Nature Reviews Physics"},{"issue":"1","key":"6302_CR141","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0377-2217(98)00038-1","volume":"114","author":"M Narciso","year":"1999","unstructured":"Narciso, M., & Lorena, L. (1999). Lagrangean\/surrogate relaxation for generalized assignment problems. European Journal of Operational Research, 114(1), 165\u2013177.","journal-title":"European Journal of Operational Research"},{"key":"6302_CR142","doi-asserted-by":"crossref","unstructured":"Ngueveu, S.U., Prins, C., & Wolfler, R. (2009). A hybrid tabu search for the m-peripatetic vehicle routing problem. In: V.\u00a0Maniezzo, T.\u00a0St\u00fctzle, S.\u00a0Vo\u00df (eds.) Matheuristics. Annals of Information Systems, vol 10. Springer, Boston, MA","DOI":"10.1007\/978-1-4419-1306-7_11"},{"key":"6302_CR143","volume-title":"Quantum computation and quantum information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M. A., & Chuang, I. L. (2000). Quantum computation and quantum information (1st ed.). Cambridge University Press.","edition":"1"},{"key":"6302_CR144","volume-title":"Quantum computation and quantum information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M. A., & Chuang, I. L. (2010). Quantum computation and quantum information (2nd ed.). Cambridge University Press.","edition":"2"},{"issue":"1","key":"6302_CR145","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/00207543.2022.2113928","volume":"61","author":"E Nikzad","year":"2023","unstructured":"Nikzad, E., & Bashiri, M. (2023). A two-stage stochastic programming model for collaborative asset protection routing problem enhanced with machine learning: a learning-based matheuristic algorithm. International Journal of Production Research, 61(1), 81\u2013113.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"6302_CR146","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/j.ejor.2020.06.040","volume":"288","author":"E Nikzad","year":"2021","unstructured":"Nikzad, E., Bashiri, M., & Abbasi, B. (2021). A matheuristic algorithm for stochastic home health care planning. European Journal of Operational Research, 288(3), 753\u2013774.","journal-title":"European Journal of Operational Research"},{"key":"6302_CR147","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.106126","volume":"152","author":"E Nikzad","year":"2023","unstructured":"Nikzad, E., Bashiri, M., & Abbasi, B. (2023). Home healthcare staff dimensioning problem for temporary caregivers: A matheuristic solution approach. Computers & Operations Research, 152, 106126.","journal-title":"Computers & Operations Research"},{"key":"6302_CR148","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10479-017-2715-9","volume":"286","author":"T Nishi","year":"2020","unstructured":"Nishi, T., Okura, T., Lalla-Ruiz, E., & Vo\u00df, S. (2020). A dynamic programming-based matheuristic for the dynamic berth allocation problem. Annals of Operations Research, 286, 391\u2013410.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"6302_CR149","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10732-023-09516-9","volume":"29","author":"A Nourmohammadzadeh","year":"2023","unstructured":"Nourmohammadzadeh, A., Sarhani, M., & Voss, S. (2023). A matheuristic approach for the family traveling salesman problem. Journal of Heuristics, 29(4), 435\u2013460.","journal-title":"Journal of Heuristics"},{"key":"6302_CR150","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-06070-5","author":"H Oshiyama","year":"2022","unstructured":"Oshiyama, H., & Ohzeki, M. (2022). Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization. Scientific Reports. https:\/\/doi.org\/10.1038\/s41598-022-06070-5","journal-title":"Scientific Reports"},{"key":"6302_CR151","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1080\/00207548808947840","volume":"26","author":"P Ow","year":"1988","unstructured":"Ow, P., & Morton, T. (1988). Filtered beam search in scheduling. International Journal of Production Research, 26, 297\u2013307.","journal-title":"International Journal of Production Research"},{"key":"6302_CR152","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106579","volume":"165","author":"KK Patel","year":"2024","unstructured":"Patel, K. K., Desaulniers, G., & Lodi, A. (2024). An improved column-generation-based matheuristic for learning classification trees. Computers & Operations Research, 165, 106579.","journal-title":"Computers & Operations Research"},{"key":"6302_CR153","doi-asserted-by":"crossref","unstructured":"Pirkwieser, S., & Raidl, G.R. (2010). Variable neighborhood search coupled with ILP-based very large neighborhood searches for the (periodic) location-routing problem. In: M.\u00a0Blesa, C.\u00a0Blum, G.\u00a0Raidl, A.\u00a0Roli, M.\u00a0Sampels (eds.) Hybrid Metaheuristics, HM 2010. Lecture Notes in Computer Science, 6373, p. 174-189. Springer","DOI":"10.1007\/978-3-642-16054-7_13"},{"key":"6302_CR154","doi-asserted-by":"crossref","unstructured":"Pisinger, D., & Ropke, S. (2010). Large neighborhood search. In M. Gendreau & J. Potvin (Eds.), Handbook of Metaheuristics, International Series in Operations Research & Management Science (Vol. 146, pp. 399\u2013419). Boston, MA: Springer.","DOI":"10.1007\/978-1-4419-1665-5_13"},{"issue":"3","key":"6302_CR155","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"B Polyak","year":"1969","unstructured":"Polyak, B. (1969). Minimization of unsmooth functionals. USSR Computational Mathematics and Mathematical Physics, 9(3), 14\u201329.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"issue":"3","key":"6302_CR156","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1016\/j.ejor.2007.04.044","volume":"191","author":"M Prandtstetter","year":"2008","unstructured":"Prandtstetter, M., & Raidl, G. R. (2008). An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. European Journal of Operational Research, 191(3), 1004\u20131022.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"6302_CR157","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10732-007-9048-9","volume":"14","author":"J Puchinger","year":"2008","unstructured":"Puchinger, J., & Raidl, G. R. (2008). Bringing order into the neighborhoods: Relaxation guided variable neighborhood search. Journal of Heuristics, 14(5), 457\u2013472.","journal-title":"Journal of Heuristics"},{"key":"6302_CR158","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ejor.2014.12.005","volume":"244","author":"G Raidl","year":"2015","unstructured":"Raidl, G. (2015). Decomposition based hybrid metaheuristics. European Journal of Operational Research, 244, 66\u201376.","journal-title":"European Journal of Operational Research"},{"key":"6302_CR159","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-75514-2_4","volume":"4771","author":"M Reimann","year":"2007","unstructured":"Reimann, M. (2007). Guiding ACO by problem relaxation: a case study on the symmetric TSP, . In: T.\u00a0Bartz-Beielstein, et\u00a0al (eds.) Hybrid Metaheuristics. HM 2007. Lecture Notes in Computer Science, 4771, 45\u201356.","journal-title":"Lecture Notes in Computer Science"},{"key":"6302_CR160","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.cor.2011.03.012","volume":"39","author":"A Roli","year":"2012","unstructured":"Roli, A., Benedettini, S., St\u00fctzle, T., & Blum, C. (2012). Large neighbourhood search algorithms for the founder sequence reconstruction problem. Computers & Operations Research, 39, 213\u2013224.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"6302_CR161","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transpoprtation Science, 40(4), 455\u2013472.","journal-title":"Transpoprtation Science"},{"issue":"12","key":"6302_CR162","doi-asserted-by":"publisher","first-page":"2106","DOI":"10.1016\/j.cor.2010.02.010","volume":"37","author":"M Salari","year":"2010","unstructured":"Salari, M., Toth, P., & Tramontani, A. (2010). An ilp improvement procedure for the open vehicle routing problem. Computer Operation Research, 37(12), 2106\u20132120.","journal-title":"Computer Operation Research"},{"issue":"18","key":"6302_CR163","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00500-017-2666-8","volume":"22","author":"I Sanchez","year":"2018","unstructured":"Sanchez, I., Mora, J., Santos, C., Gonzalez-Mendoza, M., & Montiel Moctezuma, C. (2018). Solving binary cutting stock with matheuristics using particle swarm optimization and simulated annealing. Soft Computing, 22(18), 41\u201353.","journal-title":"Soft Computing"},{"key":"6302_CR164","first-page":"11","volume":"31","author":"VI Sarvanov","year":"1981","unstructured":"Sarvanov, V. I., & Doroshko, N. N. (1981). Approximate solution of the traveling salesman problem by a local algorithm with scanning neighborhoods of factorial cardinality in cubic time. Software Algorithms and Programs, Mathematics Institute of the Belorussia Academy of Science, Minsk, 31, 11\u201313.","journal-title":"Software Algorithms and Programs, Mathematics Institute of the Belorussia Academy of Science, Minsk"},{"issue":"3","key":"6302_CR165","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.cor.2008.07.010","volume":"37","author":"V Schmid","year":"2010","unstructured":"Schmid, V., Doerner, K. F., Hartl, R. F., & Salazar-Gonz\u00e1lez, J. J. (2010). Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. Computers and Operations Research, 37(3), 559\u2013574.","journal-title":"Computers and Operations Research"},{"key":"6302_CR166","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-1-4615-4567-5_6","volume-title":"Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research","author":"ELF Senne","year":"2000","unstructured":"Senne, E. L. F., & Lorena, L. A. N. (2000). Lagrangean\/surrogate heuristics for p-median problems. In M. Laguna & J. L. Gonzalez-Velarde (Eds.), Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research (pp. 115\u2013130). Kluwer Academic Publishers."},{"key":"6302_CR167","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization methods for non-differentiable functions","author":"N Shor","year":"1985","unstructured":"Shor, N., Kiwiel, K., & Ruszcaynski, A. (1985). Minimization methods for non-differentiable functions. New York: Springer-Verlag."},{"key":"6302_CR168","doi-asserted-by":"crossref","unstructured":"Sk\u00e5lnes, J., Vadseth, S.T., Andersson, H., & St\u00e5lhane, M. (2023). A branch-and-cut embedded matheuristic for the inventory routing problem. Computers & Operations Research 159","DOI":"10.1016\/j.cor.2023.106353"},{"issue":"3","key":"6302_CR169","first-page":"551","volume":"35","author":"M Sniedovich","year":"2006","unstructured":"Sniedovich, M., & Vo\u00df, S. (2006). The corridor method. A dynamic programming inspired metaheuristic. Control and Cybernetics, 35(3), 551\u2013578.","journal-title":"Control and Cybernetics"},{"issue":"4","key":"6302_CR170","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1287\/trsc.2021.1123","volume":"56","author":"O Solyali","year":"2022","unstructured":"Solyali, O., & Sural, H. (2022). An effective matheuristic for the multivehicle inventory routing problem. Transportation Science, 56(4), 1044\u20131057.","journal-title":"Transportation Science"},{"issue":"1","key":"6302_CR171","first-page":"3","volume":"22","author":"K S\u00f6rensen","year":"2015","unstructured":"S\u00f6rensen, K. (2015). Metaheuristics - the metaphor exposed, international transactions in operational research. Special Issue: Matheuristics: Model-Based Metaheuristics, 22(1), 3\u201318.","journal-title":"Special Issue: Matheuristics: Model-Based Metaheuristics"},{"issue":"5","key":"6302_CR172","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.orl.2005.06.005","volume":"34","author":"F Sourd","year":"2006","unstructured":"Sourd, F. (2006). Dynasearch neighborhood for the earliness-tardiness scheduling problem with release dates and setup constraints. Operations Research Letters, 34(5), 591\u2013598.","journal-title":"Operations Research Letters"},{"key":"6302_CR173","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115501","volume":"185","author":"G Souto","year":"2021","unstructured":"Souto, G., Morais, I., Mauri, G. R., Ribeiro, G. M., & Gonz\u00e1lez, P. H. (2021). A hybrid matheuristic for the two-stage capacitated facility location problem. Expert Systems with Applications, 185, 115501.","journal-title":"Expert Systems with Applications"},{"key":"6302_CR174","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0377-2217(93)90219-D","volume":"66","author":"R Sridharan","year":"1991","unstructured":"Sridharan, R. (1991). A lagrangian heuristic for the capacitated plant location problem with single source constraints. European Journal of Operational Research, 66, 305\u2013312.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"6302_CR175","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10479-015-2034-y","volume":"240","author":"EG Talbi","year":"2016","unstructured":"Talbi, E. G. (2016). Combining metaheuristics with mathematical programming, constraint programming and machine learning. Annals of Operations Research, 240(1), 171\u2013215.","journal-title":"Annals of Operations Research"},{"key":"6302_CR176","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106507","volume":"163","author":"M Terzi","year":"2023","unstructured":"Terzi, M., Ouazene, Y., Yalaoui, A., & Yalaoui, F. (2023). Matheuristics vs. metaheuristics for joint lot-sizing and dynamic pricing problem with nonlinear demands. Computers & Operations Research, 163, 106507. https:\/\/doi.org\/10.1016\/j.cor.2023.106507","journal-title":"Computers & Operations Research"},{"key":"6302_CR177","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"PM Thompson","year":"1993","unstructured":"Thompson, P. M., & Psaraftis, H. N. (1993). Cyclic transfer algorithms for multivehicle routing and scheduling problems. Operations Research, 41, 935\u2013946.","journal-title":"Operations Research"},{"key":"6302_CR178","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10732-021-09468-y","volume":"27","author":"R Turke\u0161","year":"2021","unstructured":"Turke\u0161, R., S\u00f6rensen, K., & Cuervo, D. P. (2021). A matheuristic for the stochastic facility location problem. Journal of Heuristics, 27, 649\u2013694.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"6302_CR179","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/S0377-2217(02)00239-4","volume":"146","author":"S Umetani","year":"2003","unstructured":"Umetani, S., Yagiura, M., & Ibaraki, T. (2003). One-dimensional cutting stock problem to minimize the number of different patterns. European Journal of Operational Research, 146(2), 388\u2013402.","journal-title":"European Journal of Operational Research"},{"key":"6302_CR180","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105262","volume":"131","author":"ST Vadseth","year":"2021","unstructured":"Vadseth, S. T., Andersson, H., & St\u00e5lhane, M. (2021). An iterative matheuristic for the inventory routing problem. Computers & Operations Research, 131, 105262.","journal-title":"Computers & Operations Research"},{"key":"6302_CR181","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106313","volume":"159","author":"Y Wang","year":"2023","unstructured":"Wang, Y., Liu, H., Peng, B., Wang, H., & Punnen, A. P. (2023). A three-phase matheuristic algorithm for the multi-day task assignment problem. Computers & Operations Research, 159, 106313.","journal-title":"Computers & Operations Research"},{"key":"6302_CR182","doi-asserted-by":"publisher","DOI":"10.1002\/9781119606475","volume-title":"Integer Programming","author":"L Wolsey","year":"2020","unstructured":"Wolsey, L. (2020). Integer Programming (2nd ed.). John Wiley & Sons.","edition":"2"},{"issue":"6","key":"6302_CR183","doi-asserted-by":"publisher","first-page":"1677","DOI":"10.1287\/trsc.2022.1149","volume":"56","author":"T Wu","year":"2022","unstructured":"Wu, T., Zhang, C., Chen, W., Liang, Z., & Zhang, X. (2022). Unsupervised learning-driven matheuristic for production-distribution problems. Transportation Science, 56(6), 1677\u20131702.","journal-title":"Transportation Science"},{"issue":"9","key":"6302_CR184","doi-asserted-by":"publisher","first-page":"3922","DOI":"10.1016\/j.asoc.2013.04.009","volume":"13","author":"M Yaghini","year":"2013","unstructured":"Yaghini, M., Karimi, M., & Rahbar, M. A. (2013). Hybrid metaheuristic approach for the capacitated p-median problem. Applied Soft Computing, 13(9), 3922\u20133930.","journal-title":"Applied Soft Computing"},{"key":"6302_CR185","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0377-2217(94)00301-7","volume":"92","author":"M Yagiura","year":"1996","unstructured":"Yagiura, M., & Ibaraki, T. (1996). The use of dynamic programming in genetic algorithms for permutation problems. European Journal of Operational Research, 92, 387\u2013401.","journal-title":"European Journal of Operational Research"},{"key":"6302_CR186","unstructured":"Zanotti, R., Mansini, R., Ghiani, G., & Guerriero, E. (2019). A Kernel search approach for the time-dependent rural postman problem. In: WARP3, 3rd International Workshop on Arc Routing Problems. Pizzo (Calabria, Italy)"},{"key":"6302_CR187","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Chu, F., Che, A., Yu, Y., & Feng, X. (2019). Novel model and kernel search heuristic for multi-period closed-loop food supply chain planning with returnable transport items. International Journal of Production Research, 57(23), 7439\u20137456. Taylor & Francis","DOI":"10.1080\/00207543.2019.1615650"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06302-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06302-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06302-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T12:18:35Z","timestamp":1734351515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06302-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,22]]},"references-count":187,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["6302"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06302-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,22]]},"assertion":[{"value":"29 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they do not have any Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}