{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T23:55:15Z","timestamp":1768521315072,"version":"3.49.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319071237","type":"print"},{"value":"9783319071244","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-07124-4_14","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:09:59Z","timestamp":1534187399000},"page":"121-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Matheuristics"],"prefix":"10.1007","author":[{"given":"Martina","family":"Fischetti","sequence":"first","affiliation":[]},{"given":"Matteo","family":"Fischetti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Achterberg T, Berthold T, Hendel G (2012) Rounding and propagation heuristics for mixed integer programming. In: Operations research proceedings 2011, Zurich, pp 71\u201376","DOI":"10.1007\/978-3-642-29210-1_12"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Berthold T (2013) Measuring the impact of primal heuristics. Oper Res Lett 41(6):611\u2013614","DOI":"10.1016\/j.orl.2013.08.007"},{"key":"14_CR3","unstructured":"Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. Combinatorial optimization. Wiley, New York"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Danna E, Rothberg E, Le Pape C (2005) Exploring relaxation induced neighborhoods to improve MIP solutions. Math Program 102:71\u201390","DOI":"10.1007\/s10107-004-0518-7"},{"key":"14_CR5","unstructured":"Donovan S (2005) Wind farm optimization. In: Proceedings of the 40th annual ORSNZ conference, Wellington, pp 196\u2013205"},{"key":"14_CR6","unstructured":"Fischetti M (2014) Mixed-integer models and algorithms for wind farm layout optimization. Master\u2019s thesis, University of Padova. http:\/\/tesi.cab.unipd.it\/45458\/1\/tesi_Fischetti.pdf"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Fischetti M, Lodi A (2003) Local branching. Math Program 98:23\u201347","DOI":"10.1007\/s10107-003-0395-5"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Fischetti M, Lodi A (2011) Heuristics in mixed integer programming. In: Cochran JJ (ed) Wiley encyclopedia. Volume 8 of operations research and management science. John Wiley & Sons, Hoboken, pp 738\u2013747","DOI":"10.1002\/9780470400531.eorms0376"},{"key":"14_CR9","unstructured":"Fischetti M, Lodi A, Salvagnin D (2010) Just MIP it! In: Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) Matheuristics. Volume 10 of annals of information systems. Springer, Boston, pp 39\u201370"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Fischetti M, Monaci M (2014) Proximity search for 0\u20131 mixed-integer convex programming. J Heuristics 6(20):709\u2013731","DOI":"10.1007\/s10732-014-9266-x"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Fischetti M, Monaci M (2016) Proximity search heuristics for wind farm optimal layout. J Heuristics 22(4):459\u2013474","DOI":"10.1007\/s10732-015-9283-4"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Fischetti M, Monaci M, Salvagnin D (2012) Three ideas for the quadratic assignment problem. Oper Res 60(4):954\u2013964","DOI":"10.1287\/opre.1120.1073"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Fischetti M, Monaci M, Salvagnin D (2015, to appear) Mixed-integer linear programming heuristics for the prepack optimization problem. Discret Optim","DOI":"10.1016\/j.disopt.2015.03.004"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Fisher ML, Jaikumar R (1981) A generalized assignment heuristic for vehicle routing. Networks 11:109\u2013124","DOI":"10.1002\/net.3230110205"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"De Franceschi R, Fischetti M, Toth P (2006) A new ILP-based refinement heuristic for vehicle routing problems. Math Program 105(2\u20133):471\u2013499","DOI":"10.1007\/s10107-005-0662-8"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Gillett BE, Miller LR (1974) A heuristic algorithm for the vehicle dispatch problem. Oper Res 22:340\u2013349","DOI":"10.1287\/opre.22.2.340"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Glover F (1975) Improved linear integer programming formulations of nonlinear integer problems. Manage Sci 22:455\u2013460","DOI":"10.1287\/mnsc.22.4.455"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Gutin G, Yeo A, Zverovitch A (2007) Exponential neighborhoods and domination analysis for the TSP. In: Gutin G, Punnen AP (eds) The traveling salesman problem and its variations. Volume 12 of combinatorial optimization. Springer, Boston, pp 223\u2013256","DOI":"10.1007\/0-306-48213-4_6"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Hansen P, Maniezzo V, Vo\u00df S (2009) Special issue on mathematical contributions to metaheuristics editorial. J Heuristics 15(3):197\u2013199","DOI":"10.1007\/s10732-008-9093-z"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Hoskins M, Masson R, Melanon GG, Mendoza JE, Meyer C, Rousseau L-M (2014) The prepack optimization problem. In: Simonis H (ed) Integration of AI and OR techniques in constraint programming. Volume 8451 of lecture notes in computer science. Springer, Berlin\/Heidelberg, pp 136\u2013143","DOI":"10.1007\/978-3-319-07046-9_10"},{"key":"14_CR21","unstructured":"IBM ILOG (2014) CPLEX User\u2019s Manual"},{"key":"14_CR22","unstructured":"Jensen NO (1983) A note on wind generator interaction. Technical report, Riso-M-2411(EN), Riso National Laboratory, Roskilde"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Lodi A, Martello S, Monaci M (2002) Two-dimensional packing problems: a survey. Eur J Oper Res 141:241\u2013252","DOI":"10.1016\/S0377-2217(02)00123-6"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) (2010) Matheuristics \u2013 hybridizing metaheuristics and mathematical programming. Volume 10 of annals of information systems. Springer, Boston","DOI":"10.1007\/978-1-4419-1306-7"},{"key":"14_CR25","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Chichester"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Rego C, Glover F (2007) Local search and metaheuristics. In: Gutin G, Punnen A (eds) The traveling salesman problem and its variations. Volume 12 of combinatorial optimization. Springer, Boston, pp 309\u2013368","DOI":"10.1007\/0-306-48213-4_8"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Rothberg E (2007) An evolutionary algorithm for polishing mixed integer programming solutions. INFORMS J Comput 19:534\u2013541","DOI":"10.1287\/ijoc.1060.0189"},{"key":"14_CR28","unstructured":"Sarvanov VI, Doroshko NN (1981) The approximate solution of the travelling salesman problem by a local algorithm with scanning neighborhoods of factorial cardinality in cubic time (in Russian). In: Software: algorithms and programs. Mathematical Institute of the Belorussian Academy of Sciences, Minsk, pp 11\u201313"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M, Puget J-F (eds) Principles and practice of constraint programming CP98. Volume 1520 of lecture notes in computer science. Springer, Berlin\/Heidelberg, pp 417\u2013431","DOI":"10.1007\/3-540-49481-2_30"},{"key":"14_CR30","unstructured":"SIEMENS AG. SWT-2.3-93 Turbine, Technical Specifications. http:\/\/www.energy.siemens.com"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2002) An overview of vehicle routing problems. In: The vehicle routing problem. SIAM monographs on discrete mathematics and applications, Philadelphia","DOI":"10.1137\/1.9780898718515.ch1"},{"key":"14_CR32","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1080\/10556780500273077","volume":"21","author":"Y Xia","year":"2006","unstructured":"Xia Y, Yuan YX (2006) A new linearization method for quadratic assignment problem. Optim Methods Softw 21:803\u2013816","journal-title":"Optim Methods Softw"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T07:18:36Z","timestamp":1571728716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_14","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}