{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T10:35:51Z","timestamp":1781606151103,"version":"3.54.5"},"reference-count":136,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T00:00:00Z","timestamp":1652054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T00:00:00Z","timestamp":1652054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Matheuristics are heuristic algorithms based on mathematical tools such as the ones provided by mathematical programming, that are structurally general enough to be applied to different problems with little adaptations to their abstract structure. The result can be metaheuristic hybrids having components derived from the mathematical model of the problems of interest, but the mathematical techniques themselves can define general heuristic solution frameworks. In this paper, we focus our attention on mathematical programming and its contributions to developing effective heuristics. We briefly describe the mathematical tools available and then some matheuristic approaches, reporting some representative examples from the literature. We also take the opportunity to provide some ideas for possible future development.\n<\/jats:p>","DOI":"10.1007\/s10288-022-00510-8","type":"journal-article","created":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T16:03:12Z","timestamp":1652112192000},"page":"173-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["Matheuristics: using mathematics for heuristic design"],"prefix":"10.1007","volume":"20","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":[[2022,5,9]]},"reference":[{"key":"510_CR1","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. J Oper Res Soc 49:1072\u20131084","journal-title":"J Oper Res Soc"},{"key":"510_CR2","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. Oper Res 45:226\u2013234","journal-title":"Oper Res"},{"key":"510_CR3","unstructured":"Ahuja RK, Orlin JB, 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":"510_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1475-3995.2000.tb00201.x","volume":"7","author":"RK Ahuja","year":"2000","unstructured":"Ahuja RK, Orlin JB, Sharma D (2000) Very large-scale neighborhood search. Int Trans Oper Res 7(4\u20135):301\u2013317","journal-title":"Int Trans Oper Res"},{"key":"510_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"RK Ahuja","year":"2002","unstructured":"Ahuja RK, Ergun O, Orlin JB, Punnen APA (2002) Survey of very large-scale neighborhood search techniques. Discrete Appl Math 123:75\u2013102","journal-title":"Discrete Appl Math"},{"key":"510_CR6","unstructured":"Angelelli E, Mansini R, Speranza MG (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":"510_CR7","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 MG (2010) Kernel search: a general heuristic for the multi-dimensional knapsack problem. Comput Oper Res 37(11):2017\u20132026","journal-title":"Comput Oper Res"},{"issue":"1","key":"510_CR8","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 MG (2012) Kernel search: a new heuristic framework for portfolio selection. Comput Optim Appl 51(1):345\u2013361","journal-title":"Comput Optim Appl"},{"key":"510_CR9","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. J Heuristics 13:543\u2013556","journal-title":"J Heuristics"},{"key":"510_CR10","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. Math Program 87:385\u2013399","journal-title":"Math Program"},{"key":"510_CR11","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. Eur J Oper Res 15:212\u2013226","journal-title":"Eur J Oper Res"},{"issue":"3","key":"510_CR12","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. J Heuristics 15(3):259\u2013281","journal-title":"J Heuristics"},{"key":"510_CR13","first-page":"12","volume-title":"LION 2, LNCS 5313","author":"E Bartolini","year":"2008","unstructured":"Bartolini E, Maniezzo V, Mingozzi A (2008) An adaptive memory-based approach based on partial enumeration. In: Maniezzo V, Battiti R, Watson JP (eds) LION 2, LNCS 5313. Springer, Berlin, pp 12\u201324"},{"key":"510_CR14","volume-title":"Linear programming and network flows","author":"MS Bazaraa","year":"1990","unstructured":"Bazaraa MS, Jarvis J, Sherali HD (1990) Linear programming and network flows. Wiley, Hoboken"},{"key":"510_CR15","doi-asserted-by":"crossref","unstructured":"Beasley J (1993a) Lagrangian heuristics for location problems. Eur J Oper Res 65:383\u2013399","DOI":"10.1016\/0377-2217(93)90118-7"},{"key":"510_CR16","unstructured":"Beasley JE (1993b) Lagrangian relaxation. In: Reeves CR (ed) Modern heuristic techniques for combinatorial problems. Wiley, New York, pp 243\u2013303"},{"issue":"2","key":"510_CR17","first-page":"277","volume":"5","author":"R Bellman","year":"1957","unstructured":"Bellman R (1957) Dynamic programming and the numerical solution of variational problems. Oper Res 5(2):277\u2013288","journal-title":"Oper Res"},{"key":"510_CR18","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4:280\u2013322","journal-title":"Numer Math"},{"issue":"1","key":"510_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"HG Beyer","year":"2002","unstructured":"Beyer HG, Schwefel HP (2002) Evolution strategies\u2014a comprehensive introduction. Nat Comput 1(1):3\u201352","journal-title":"Nat Comput"},{"key":"510_CR20","first-page":"19","volume-title":"MIP: theory and practice\u2014closing the gap","author":"RE Bixby","year":"2000","unstructured":"Bixby RE, Fenelon M, Gu Z, Rothberg E, Wunderling R (2000) MIP: theory and practice\u2014closing the gap. Kluwer Academic Publishers, Amsterdam, pp 19\u201349"},{"issue":"6","key":"510_CR21","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\u2014hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput Oper Res 32(6):1565\u20131591","journal-title":"Comput Oper Res"},{"issue":"4","key":"510_CR22","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 J Comput 20(4):618\u2013627","journal-title":"INFORMS J Comput"},{"issue":"3","key":"510_CR23","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. Eur J Oper Res 195(3):770\u2013779","journal-title":"Eur J Oper Res"},{"key":"510_CR24","doi-asserted-by":"crossref","unstructured":"Boschetti M, Maniezzo V (2009a) Benders decomposition, Lagrangean relaxation and metaheuristic design. J Heuristics 15:283\u2013312","DOI":"10.1007\/s10732-007-9064-9"},{"key":"510_CR25","doi-asserted-by":"crossref","unstructured":"Boschetti MA, Maniezzo V (2009b) Benders decomposition, Lagrangian relaxation and metaheuristic design. J Heuristics 15(3):283\u2013312","DOI":"10.1007\/s10732-007-9064-9"},{"issue":"1","key":"510_CR26","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1111\/itor.12110","volume":"22","author":"MA Boschetti","year":"2015","unstructured":"Boschetti MA, Maniezzo V (2015) A set covering based matheuristic for a real-world city logistics problem. Int Trans Oper Res 22(1):169\u2013195","journal-title":"Int Trans Oper Res"},{"key":"510_CR27","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1023\/B:ANOR.0000019089.86834.91","volume":"127","author":"MA Boschetti","year":"2004","unstructured":"Boschetti MA, Mingozzi A, Ricciardelli S (2004) An exact algorithm for the simplified multi depot crew scheduling problem. Ann Oper Res 127:177\u2013201","journal-title":"Ann Oper Res"},{"issue":"4","key":"510_CR28","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1016\/j.disopt.2008.06.001","volume":"5","author":"MA Boschetti","year":"2008","unstructured":"Boschetti MA, Mingozzi A, Ricciardelli S (2008) A dual ascent procedure for the set partitioning problem. Discrete Optim 5(4):735\u2013747","journal-title":"Discrete Optim"},{"key":"510_CR29","doi-asserted-by":"crossref","unstructured":"Boschetti M, Maniezzo V, Roffilli M (2009a) Decomposition techniques as metaheuristic frameworks. In: Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) Matheuristics, vol 10. Annals of information systems. Springer, Boston","DOI":"10.1007\/978-1-4419-1306-7"},{"key":"510_CR30","doi-asserted-by":"crossref","unstructured":"Boschetti M.A, Maniezzo V, Roffilli M, Boluf\u00e9\u00a0R\u00f6hler A (2009b) Matheuristics: optimization, simulation and control. In: Blesa M, Blum C, Di\u00a0Gaspero L, Roli A, Sampels M, Schaerf A (eds) Hybrid metaheuristics, vol 5818. HM 2009. Lecture notes in computer science. Springer, Berlin","DOI":"10.1007\/978-3-642-04918-7_13"},{"issue":"1","key":"510_CR31","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1287\/ijoc.1100.0381","volume":"23","author":"MA Boschetti","year":"2011","unstructured":"Boschetti MA, Maniezzo V, Roffilli M (2011) Fully distributed Lagrangian solution for a peer-to-peer overlay network design problem. INFORMS J Comput 23(1):90\u2013104","journal-title":"INFORMS J Comput"},{"key":"510_CR32","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.jpdc.2018.07.009","volume":"133","author":"MA Boschetti","year":"2019","unstructured":"Boschetti MA, Maniezzo V, Strappaveccia F (2019) Membership overlay design optimization with resource constraints (accelerated on GPU). J Parallel Distrib Comput 133:286\u2013296","journal-title":"J Parallel Distrib Comput"},{"key":"510_CR33","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.omega.2019.03.002","volume":"93","author":"MA Boschetti","year":"2020","unstructured":"Boschetti MA, Golfarelli M, Graziani S (2020) An exact method for shrinking pivot tables. Omega 93:10\u201344","journal-title":"Omega"},{"issue":"3","key":"510_CR34","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. Eur J Oper Res 199(3):658\u2013664","journal-title":"Eur J Oper Res"},{"key":"510_CR35","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 JL (2007) Two exponential neighborhoods for single machine scheduling. OR Spectrum 29:513\u2013533","journal-title":"OR Spectrum"},{"issue":"6","key":"510_CR36","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 JL (2011) Matching based very large-scale neighborhoods for parallel machine scheduling. J Heuristics 17(6):637\u2013658","journal-title":"J Heuristics"},{"key":"510_CR37","doi-asserted-by":"crossref","unstructured":"Caserta M, Vo\u00df S (2009a) A cooperative strategy for guiding the corridor method. In: Krasnogor N et al (eds) Nature inspired cooperative strategies for optimization (NICSO 2008), vol 236. Studies in computational intelligence. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-03211-0_23"},{"key":"510_CR38","doi-asserted-by":"crossref","unstructured":"Caserta M, Vo\u00df S (2009b) Corridor selection and fine tuning for the corridor method. In: St\u00fctzle T (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":"510_CR39","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 Appl Math 163:87\u201399","journal-title":"Discrete Appl Math"},{"key":"510_CR40","series-title":"EvoApplications 2010. Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-642-12242-2_47","volume-title":"Applications of evolutionary computation","author":"M Caserta","year":"2010","unstructured":"Caserta M, Ramirez A, Vo\u00df S (2010) A math-heuristic for the multi-level capacitated lot sizing problem with carryover. In: Chio CD et al (eds) Applications of evolutionary computation, vol 6025. EvoApplications 2010. Lecture notes in computer science. Springer, Berlin, pp 462\u2013471"},{"key":"510_CR41","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. Oper Res Spektrum 33:915\u2013929","journal-title":"Oper Res Spektrum"},{"key":"510_CR42","series-title":"Studies in computational intelligence","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-540-78295-7_5","volume-title":"Hybrid metaheuristics","author":"M Chiarandini","year":"2008","unstructured":"Chiarandini M, Dumitrescu I, St\u00fctzle T (2008) Very large-scale neighborhood search: overview and case studies on coloring problems. In: Blum C, Blesa MJ, Roli A, Sampels M (eds) Hybrid metaheuristics, vol 114. Studies in computational intelligence. Springer, Berlin, pp 117\u2013150"},{"issue":"2","key":"510_CR43","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":"510_CR44","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-25960-2_14","volume-title":"Integer programming and combinatorial optimization","author":"G Codato","year":"2004","unstructured":"Codato G, Fischetti M (2004) Combinatorial benders\u2019 cuts. In: Bienstock D, Nemhauser G (eds) Integer programming and combinatorial optimization. Springer, Berlin Heidelberg, pp 178\u2013195"},{"key":"510_CR45","unstructured":"Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. In: Varela F, Bourgine P (eds) Proceedings of the European conference on artificial life, ECAL\u201991, Paris. Elsevier Publishing, Amsterdam, pp 134\u2013142"},{"issue":"1","key":"510_CR46","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"RK Congram","year":"2002","unstructured":"Congram RK, Potts CN, van de Velde S (2002) An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J Comput 14(1):52\u201367","journal-title":"INFORMS J Comput"},{"key":"510_CR47","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10732-005-2634-9","volume":"11","author":"CB Cunha","year":"2005","unstructured":"Cunha CB, Ahuja RK (2005) Very large scale neighborhood search for the k-constrained multiple knapsack problem. J Heuristics 11:465\u2013481","journal-title":"J Heuristics"},{"key":"510_CR48","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-06944-9_1","volume-title":"Bio-inspired models of network, information, and computing systems","author":"FA D\u2019Andreagiovanni","year":"2014","unstructured":"D\u2019Andreagiovanni FA (2014) Hybrid exact-ACO algorithm for the joint scheduling, power and cluster assignment in cooperative wireless networks. In: Di\u00a0Caro G, Theraulaz G (eds) Bio-inspired models of network, information, and computing systems. Springer, Berlin, pp 3\u201317"},{"issue":"1","key":"510_CR49","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. Math Program 102(1):71\u201390","journal-title":"Math Program"},{"key":"510_CR50","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper Res 8:101\u2013111","journal-title":"Oper Res"},{"issue":"2\u20133","key":"510_CR51","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10107-005-0662-8","volume":"105","author":"R De\u00a0Franceschi","year":"2006","unstructured":"De\u00a0Franceschi R, Fischetti M, Toth P (2006) A new ILP-based refinement heuristic for vehicle routing problems. Math Program B 105(2\u20133):471\u2013499","journal-title":"Math Program B"},{"issue":"1","key":"510_CR52","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. J Heuristics 10(1):89\u2013104","journal-title":"J Heuristics"},{"key":"510_CR53","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ijepes.2014.01.038","volume":"59","author":"FR Dewan","year":"2014","unstructured":"Dewan FR, Viana A, Pedroso J (2014) Metaheuristic search based methods for unit commitment. J Int J Electr Power Energy Syst 59:14\u201322","journal-title":"J Int J Electr Power Energy Syst"},{"key":"510_CR54","doi-asserted-by":"crossref","unstructured":"Dokka T, Letchford A, Mansoor M (2021a) On the complexity of surrogate and group relaxation for integer linear programs. Oper Res Lett 49(4):530\u2013534","DOI":"10.1016\/j.orl.2021.05.011"},{"key":"510_CR55","doi-asserted-by":"crossref","unstructured":"Dokka T, Letchford A, Mansoor M (2021b) Revisiting surrogate relaxation for the multi-dimensional knapsack problem. Oper Res Lett (Submitted)","DOI":"10.1016\/j.orl.2022.10.003"},{"key":"510_CR56","doi-asserted-by":"crossref","unstructured":"Dolgui A, Eremeev A, Guschinskaya O (2009) MIP-based GRASP and genetic algorithm for balancing transfer lines. In: Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) Matheuristics. Annals of Information Systems, vol 10. Springer, Boston. https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4419-1306-7_7","DOI":"10.1007\/978-1-4419-1306-7_7"},{"key":"510_CR57","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. MIT Press, Cambridge"},{"issue":"1","key":"510_CR58","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 Trans Syst Man Cybern Part B (Cybern) 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"key":"510_CR59","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":"1\u20132","key":"510_CR60","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 JB, Steele-Feldman A (2006) Creating very large scale neighborhoods out of smaller ones by compounding moves. J Heuristics 12(1\u20132):115\u2013140","journal-title":"J Heuristics"},{"key":"510_CR61","doi-asserted-by":"crossref","unstructured":"Fischetti M, Fischetti M (2018) Matheuristics. In: Marti R, Pardalos PM, Resende MGC (eds) Handbook of heuristics. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-07124-4_14","DOI":"10.1007\/978-3-319-07124-4_14"},{"issue":"1\u20133","key":"510_CR62","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti M, Lodi A (2003) Local branching. Math Program Ser B 98(1\u20133):23\u201347","journal-title":"Math Program Ser B"},{"key":"510_CR63","series-title":"Annals of information systems","volume-title":"Matheuristics, hybridizing metaheuristics and mathematical programming","author":"M Fischetti","year":"2009","unstructured":"Fischetti M, Lodi A, Salvagnin D (2009) Just mip it! In: Maniezzo V, St\u00fctzle T, Voss S (eds) Matheuristics, hybridizing metaheuristics and mathematical programming, vol 10. Annals of information systems. Springer, Boston"},{"issue":"9","key":"510_CR64","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","volume":"32","author":"ML Fisher","year":"1986","unstructured":"Fisher ML, Jaikumar R, Van Wassenhove LN (1986) A multiplier adjustment method for the generalized assignment problem. Manag Sci 32(9):1095\u20131103","journal-title":"Manag Sci"},{"key":"510_CR65","doi-asserted-by":"crossref","unstructured":"Flushing EF, Di Caro GA (2012) Exploiting synergies between exact and heuristic methods in optimization: an application to the relay placement problem in wireless sensor networks. In: Di Caro G, Theraulaz G (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":"510_CR66","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.cor.2016.04.016","volume":"74","author":"GH Fonseca","year":"2016","unstructured":"Fonseca GH, Santos HG, Carrano EG (2016) Integrating matheuristics and metaheuristics for timetabling. Comput Oper Res 74:108\u2013117","journal-title":"Comput Oper Res"},{"key":"510_CR67","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 JY, Seguin R (2006) Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transp Res Part C Emerg Technol 14:157\u2013174","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"12","key":"510_CR68","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":"510_CR69","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. Oper Res 13:879\u2013919","journal-title":"Oper Res"},{"key":"510_CR70","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. Oper Res 16:741\u2013749","journal-title":"Oper Res"},{"key":"510_CR71","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. Oper Res 23:434\u2013451","journal-title":"Oper Res"},{"issue":"1","key":"510_CR72","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. Decis Sci 8(1):156\u2013166","journal-title":"Decis Sci"},{"issue":"3","key":"510_CR73","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\u2014part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"1","key":"510_CR74","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\u2014part II. ORSA J Comput 2(1):14\u201332","journal-title":"ORSA J Comput"},{"key":"510_CR75","series-title":"Optimization and machine learning","volume-title":"Genetic algorithms in search","author":"D Goldberg","year":"1989","unstructured":"Goldberg D (1989) Genetic algorithms in search. Optimization and machine learning. Addison-Wesley Professional, Reading"},{"key":"510_CR76","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1287\/opre.18.5.924","volume":"18","author":"HJ Greenberg","year":"1970","unstructured":"Greenberg HJ, Pierskalla WP (1970) Surrogate mathematical programming. Oper Res 18:924\u2013939","journal-title":"Oper Res"},{"key":"510_CR77","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. Comput Oper Res 33:2590\u20132601","journal-title":"Comput Oper Res"},{"issue":"1","key":"510_CR78","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 MG (2012) Kernel search: an application to the index tracking problem. Eur J Oper Res 217(1):54\u201368","journal-title":"Eur J Oper Res"},{"key":"510_CR79","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M Guignard","year":"1987","unstructured":"Guignard M, Kim S (1987) Lagrangean decomposition: a model yielding stronger Lagrangean bounds. Math Program 39:215\u2013228","journal-title":"Math Program"},{"issue":"12","key":"510_CR80","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. Comput Oper Res 39(12):3074\u20133088","journal-title":"Comput Oper Res"},{"issue":"2","key":"510_CR81","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1287\/ijoc.1090.0348","volume":"22","author":"M Hewitt","year":"2010","unstructured":"Hewitt M, Nemhauser GL, Savelsbergh MWP (2010) Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS J Comput 22(2):314\u2013325","journal-title":"INFORMS J Comput"},{"key":"510_CR82","series-title":"A series of comprehensive studies in mathematics, 306","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-06409-2","volume-title":"Convex analysis and minimization algorithms II: advanced theory and bundle methods","author":"JB Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty JB, Lemarechal C (1993) Convex analysis and minimization algorithms II: advanced theory and bundle methods. A series of comprehensive studies in mathematics, 306. Springer, Berlin"},{"key":"510_CR83","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. MIT Press, Cambridge"},{"issue":"1","key":"510_CR84","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. Eur J Oper Res 97(1):63\u201374","journal-title":"Eur J Oper Res"},{"key":"510_CR85","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. Morgan Kaufmann, San Francisco"},{"key":"510_CR86","unstructured":"Hu B, Raidl GR (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"},{"issue":"5","key":"510_CR87","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 GR (2008) Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J Heuristics 14(5):473\u2013499","journal-title":"J Heuristics"},{"key":"510_CR88","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995\u2014international conference on neural networks, vol\u00a04, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"510_CR89","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":"510_CR90","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1111\/itor.12063","volume":"22","author":"R Lopes","year":"2015","unstructured":"Lopes R, Morais VW, Noronha TF, Souza V (2015) Heuristics and matheuristics for a real-life machine reassignment problem. Int Trans Oper Res 22:77\u201395","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"510_CR91","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. Eur J Oper Res 79(1):138\u2013150","journal-title":"Eur J Oper Res"},{"key":"510_CR92","series-title":"International series in operations research and management science","first-page":"321","volume-title":"Handbook of metaheuristics","author":"HR Louren\u00e7o","year":"2002","unstructured":"Louren\u00e7o HR, Martin O, St\u00fctzle T (2002) Iterated local search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. International series in operations research and management science. Kluwer Academic Publishers, New York, pp 321\u2013353"},{"key":"510_CR93","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o HR, Martin O, St\u00fctzle T (2010) Iterated local search: framework and applications. In: Gendreau M, Potvin J (eds) Handbook of metaheuristics, vol 146, 2nd edn. International series in operations research and management science. Springer, New York, pp 363\u2013397. ISBN: 978-1-4419-1663-1","DOI":"10.1007\/978-1-4419-1665-5_12"},{"key":"510_CR94","unstructured":"Lowerre B (1976) The HARPY speech recognition system. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA"},{"issue":"4","key":"510_CR95","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 J Comput 11(4):358\u2013369","journal-title":"INFORMS J Comput"},{"key":"510_CR96","unstructured":"Maniezzo V (2006) Matheuristics 2006 conference web portal. http:\/\/astarte.csr.unibo.it\/Matheuristics2006\/"},{"key":"510_CR97","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/itor.12531","volume":"27","author":"V Maniezzo","year":"2020","unstructured":"Maniezzo V, St\u00fctzle T (2020) Special issue: matheuristics and metaheuristics. Int Trans Oper Res 27:1","journal-title":"Int Trans Oper Res"},{"key":"510_CR98","series-title":"Annals of information systems, 10","volume-title":"Matheuristics: hybridizing metaheuristics and mathematical programming","author":"V Maniezzo","year":"2009","unstructured":"Maniezzo V, St\u00fctzle T, Vo\u00df S (2009) Matheuristics: hybridizing metaheuristics and mathematical programming. Annals of information systems, 10. Speringer, Berlin"},{"key":"510_CR99","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":"510_CR100","series-title":"EURO advanced tutorials on operational research","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-70277-9","volume-title":"Matheuristics: algorithms and implementations","author":"V Maniezzo","year":"2021","unstructured":"Maniezzo V, Boschetti M, Stuezle T (2021) Matheuristics: algorithms and implementations. EURO advanced tutorials on operational research. Springer, Berlin"},{"issue":"6","key":"510_CR101","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087\u20131092","journal-title":"J Chem Phys"},{"key":"510_CR102","doi-asserted-by":"crossref","unstructured":"Meyers C, Orlin JB (2006) Very large-scale neighborhood search techniques in timetabling problems. In: Burke EK, Rudov\u00e1 H (eds) Proceedings of the 6th international conference on practice and theory of automated timetabling VI (PATAT\u201906). Springer, Berlin, Heidelberg, pp 24\u201339","DOI":"10.1007\/978-3-540-77345-0_2"},{"key":"510_CR103","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 MA, Ricciardelli S, Bianco LA (1999) Set partitioning approach to the crew scheduling problem. Oper Res 47:873\u2013888","journal-title":"Oper Res"},{"issue":"5","key":"510_CR104","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 AP (2008) Very large-scale variable neighborhood search for the generalized assignment problem. J Interdiscip Math 11(5):653\u2013670","journal-title":"J Interdiscip Math"},{"key":"510_CR105","series-title":"Annals of information systems","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-1-4419-1306-7_10","volume-title":"Matheuristics: hybridizing metaheuristics and mathematical programming","author":"S Mitrovi\u0107-Mini\u0107","year":"2009","unstructured":"Mitrovi\u0107-Mini\u0107 S, Punnen AP (2009) Variable intensity local search. In: Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) Matheuristics: hybridizing metaheuristics and mathematical programming, vol 10. Annals of information systems. Springer, Boston, pp 245\u2013252"},{"issue":"11","key":"510_CR106","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. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"1","key":"510_CR107","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. Eur J Oper Res 114(1):165\u2013177","journal-title":"Eur J Oper Res"},{"key":"510_CR108","series-title":"Annals of information systems","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1306-7_11","volume-title":"Matheuristics","author":"SU Ngueveu","year":"2009","unstructured":"Ngueveu SU, Prins C, Wolfler R (2009) A hybrid tabu search for the m-peripatetic vehicle routing problem. In: Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) Matheuristics, vol 10. Annals of information systems. Springer, Boston"},{"key":"510_CR109","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. Ann Oper Res 286:391\u2013410","journal-title":"Ann Oper Res"},{"key":"510_CR110","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. Int J Prod Res 26:297\u2013307","journal-title":"Int J Prod Res"},{"key":"510_CR111","series-title":"HM 2010. Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-16054-7_13","volume-title":"Hybrid metaheuristics","author":"S Pirkwieser","year":"2010","unstructured":"Pirkwieser S, Raidl GR (2010) Variable neighborhood search coupled with ILP-based very large neighborhood searches for the (periodic) location-routing problem. In: Blesa M, Blum C, Raidl G, Roli A, Sampels M (eds) Hybrid metaheuristics, vol 6373. HM 2010. Lecture notes in computer science. Springer, Berlin, pp 174\u2013189"},{"key":"510_CR112","series-title":"International series in operations research and management science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of metaheuristics","author":"D Pisinger","year":"2010","unstructured":"Pisinger D, Ropke S (2010) Large neighborhood search. In: Gendreau M, Potvin J (eds) Handbook of metaheuristics, vol 146. International series in operations research and management science. Springer, Boston, pp 399\u2013419"},{"issue":"3","key":"510_CR113","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 Comput Math Math Phys 9(3):14\u201329","journal-title":"USSR Comput Math Math Phys"},{"issue":"3","key":"510_CR114","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 GR (2008) An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. Eur J Oper Res 191(3):1004\u20131022","journal-title":"Eur J Oper Res"},{"issue":"5","key":"510_CR115","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 GR (2008) Bringing order into the neighborhoods: relaxation guided variable neighborhood search. J Heuristics 14(5):457\u2013472","journal-title":"J Heuristics"},{"key":"510_CR116","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. Eur J Oper Res 244:66\u201376","journal-title":"Eur J Oper Res"},{"key":"510_CR117","series-title":"HM 2007, Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-75514-2_4","volume-title":"Hybrid metaheuristics","author":"M Reimann","year":"2007","unstructured":"Reimann M (2007) Guiding ACO by problem relaxation: a case study on the symmetric TSP. In: Bartz-Beielstein T et al (eds) Hybrid metaheuristics, vol 4771. HM 2007, Lecture notes in computer science. Springer, Berlin, pp 45\u201356"},{"key":"510_CR118","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. Comput Oper Res 39:213\u2013224","journal-title":"Comput Oper Res"},{"issue":"4","key":"510_CR119","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. Transp Sci 40(4):455\u2013472","journal-title":"Transp Sci"},{"issue":"12","key":"510_CR120","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. Comput Oper Res 37(12):2106\u20132120","journal-title":"Comput Oper Res"},{"issue":"18","key":"510_CR121","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 Comput 22(18):41\u201353","journal-title":"Soft Comput"},{"key":"510_CR122","first-page":"11","volume":"31","author":"V.I Sarvanov","year":"1981","unstructured":"Sarvanov V.I, Doroshko NN (1981) Approximate solution of the traveling salesman problem by a local algorithm with scanning neighborhoods of factorial cardinality in cubic time. Softw Algorithms Programs Math Inst Beloruss Acad Sci Minsk 31:11\u201313","journal-title":"Softw Algorithms Programs Math Inst Beloruss Acad Sci Minsk"},{"issue":"3","key":"510_CR123","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 KF, Hartl RF, Salazar-Gonz\u00e1lez JJ (2010) Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. Comput Oper Res 37(3):559\u2013574","journal-title":"Comput Oper Res"},{"key":"510_CR124","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 ELF, Lorena LAN (2000) Lagrangean\/surrogate heuristics for p-median problems. In: Laguna M, Gonzalez-Velarde JL (eds) Computing tools for modeling, optimization and simulation: interfaces in computer science and operations research. Kluwer Academic Publishers, New York, pp 115\u2013130"},{"key":"510_CR125","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. Springer, New York"},{"issue":"3","key":"510_CR126","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 Cybern 35(3):551\u2013578","journal-title":"Control Cybern"},{"issue":"1","key":"510_CR127","first-page":"3","volume":"22","author":"K S\u00f6rensen","year":"2015","unstructured":"S\u00f6rensen K (2015) Metaheuristics\u2014the 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":"510_CR128","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. Oper Res Lett 34(5):591\u2013598","journal-title":"Oper Res Lett"},{"key":"510_CR129","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. Eur J Oper Res 66:305\u2013312","journal-title":"Eur J Oper Res"},{"key":"510_CR130","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"PM Thompson","year":"1993","unstructured":"Thompson PM, Psaraftis HN (1993) Cyclic transfer algorithms for multivehicle routing and scheduling problems. Oper Res 41:935\u2013946","journal-title":"Oper Res"},{"issue":"2","key":"510_CR131","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. Eur J Oper Res 146(2):388\u2013402","journal-title":"Eur J Oper Res"},{"key":"510_CR132","doi-asserted-by":"publisher","DOI":"10.1002\/9781119606475","volume-title":"Integer programming","author":"L Wolsey","year":"2020","unstructured":"Wolsey L (2020) Integer programming, vol 2. Wiley, Hoboken"},{"issue":"9","key":"510_CR133","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 MA (2013) Hybrid metaheuristic approach for the capacitated p-median problem. Appl Soft Comput 13(9):3922\u20133930","journal-title":"Appl Soft Comput"},{"key":"510_CR134","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. Eur J Oper Res 92:387\u2013401","journal-title":"Eur J Oper Res"},{"key":"510_CR135","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)"},{"issue":"23","key":"510_CR136","doi-asserted-by":"publisher","first-page":"7439","DOI":"10.1080\/00207543.2019.1615650","volume":"57","author":"Y Zhang","year":"2019","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. Int J Prod Res 57(23):7439\u20137456","journal-title":"Int J Prod Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-022-00510-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-022-00510-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-022-00510-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T12:07:15Z","timestamp":1668341235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-022-00510-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,9]]},"references-count":136,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["510"],"URL":"https:\/\/doi.org\/10.1007\/s10288-022-00510-8","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,9]]},"assertion":[{"value":"15 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2022","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Missing Open Access funding information has been added in the Funding Note.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}