{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T14:57:50Z","timestamp":1780498670256,"version":"3.54.1"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,19]],"date-time":"2017-05-19T00:00:00Z","timestamp":1495152000000},"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":["J Heuristics"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s10732-017-9336-y","type":"journal-article","created":{"date-parts":[[2017,5,19]],"date-time":"2017-05-19T12:34:16Z","timestamp":1495197256000},"page":"165-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Mathematical programming based heuristics for the 0\u20131 MIP: a survey"],"prefix":"10.1007","volume":"23","author":[{"given":"Sa\u00efd","family":"Hanafi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raca","family":"Todosijevi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,5,19]]},"reference":[{"issue":"1","key":"9336_CR1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.6.1.82","volume":"6","author":"R Aboudi","year":"1994","unstructured":"Aboudi, R., J\u00f6rnsten, K.: Tabu search for general zero-one integer programs using the pivot and complement heuristic. ORSA J. Comput. 6(1), 82\u201393 (1994)","journal-title":"ORSA J. Comput."},{"key":"9336_CR2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0167-6377(89)90028-X","volume":"8","author":"R Aboudi","year":"1989","unstructured":"Aboudi, R., Hallefjord, A., Helming, R., Jornsten, K.: A note on the pivot and complement heuristic for 0\u20131 programming problems. Oper. Res. Lett. 8, 21\u201323 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9336_CR3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.disopt.2006.10.004","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T., Berthold, T.: Improving the feasibility pump. Discrete Optim. 4(1), 77\u201386 (2007)","journal-title":"Discrete Optim."},{"issue":"1","key":"9336_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: Scip: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"9336_CR5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","volume":"26","author":"E Balas","year":"1980","unstructured":"Balas, E., Martin, C.: Pivot and complement-a heuristic for 0\u20131 programming. Manag. Sci. 26, 86\u201396 (1980)","journal-title":"Manag. Sci."},{"key":"9336_CR6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/opre.49.2.207.13535","volume":"49","author":"E Balas","year":"2001","unstructured":"Balas, E., Ceria, S., Dawande, M., Margot, F., Pataki, G.: Octane: a new heuristic for pure 0\u20131 programs. Oper. Res. 49, 207\u2013225 (2001)","journal-title":"Oper. Res."},{"key":"9336_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.disopt.2004.03.001","volume":"1","author":"E Balas","year":"2004","unstructured":"Balas, E., Schmieta, S., Wallace, C.: Pivot and shift-a mixed integer programming heuristic. Discrete Optim. 1, 3\u201312 (2004)","journal-title":"Discrete Optim."},{"issue":"1","key":"9336_CR8","first-page":"21","volume":"16","author":"MO Ball","year":"2011","unstructured":"Ball, M.O.: Heuristics based on mathematical programming. Surv. Oper. Res. Manag. Sci. 16(1), 21\u201338 (2011)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"issue":"3","key":"9336_CR9","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","volume":"65","author":"JE Beasley","year":"1993","unstructured":"Beasley, J.E.: Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65(3), 383\u2013399 (1993)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9336_CR10","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1287\/mnsc.46.5.724.12048","volume":"46","author":"G Belvaux","year":"2000","unstructured":"Belvaux, G., Wolsey, L.A.: Bcprod: a specialized branch-and-cut system for lot-sizing problems. Manag. Sci. 46(5), 724\u2013738 (2000)","journal-title":"Manag. Sci."},{"issue":"1","key":"9336_CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.disopt.2006.10.001","volume":"4","author":"L Bertacco","year":"2007","unstructured":"Bertacco, L., Fischetti, M., Lodi, A.: A feasibility pump heuristic for general mixed-integer problems. Discrete Optim. 4(1), 63\u201376 (2007)","journal-title":"Discrete Optim."},{"key":"9336_CR12","unstructured":"Berthold, T.: Primal heuristics for mixed integer programs. Master\u2019s thesis, Technischen Universitat Berlin (2006)"},{"key":"9336_CR13","unstructured":"Berthold, T.: Rens-relaxation enforced neighborhood search. Technical report tr-07-28, ZIB, Berlin (2007)"},{"key":"9336_CR14","unstructured":"Berthold, T.: Heuristic algorithms in global minlp solvers. Ph.D. thesis, Technischen Universitat Berlin (2014)"},{"key":"9336_CR15","first-page":"1","volume-title":"Mixed Integer Nonlinear Programming","author":"P Bonami","year":"2012","unstructured":"Bonami, P., Kilin\u00e7, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, pp. 1\u201339. Springer, Berlin (2012)"},{"issue":"2","key":"9336_CR16","first-page":"97","volume":"17","author":"S Burer","year":"2012","unstructured":"Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manag. Sci. 17(2), 97\u2013106 (2012)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"issue":"6","key":"9336_CR17","doi-asserted-by":"crossref","first-page":"1206","DOI":"10.1287\/opre.16.6.1206","volume":"16","author":"AV Cabot","year":"1968","unstructured":"Cabot, A.V., Hurter Jr., A.P.: An approach to zero-one integer programming. Oper. Res. 16(6), 1206\u20131211 (1968)","journal-title":"Oper. Res."},{"issue":"1","key":"9336_CR18","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., Pape, L.C.: Exploring relaxation induced neighborhoods to improve mip solutions. Math. Program. 102(1), 71\u201390 (2005)","journal-title":"Math. Program."},{"key":"9336_CR19","volume-title":"Programming in a Linear Structure. Comptroller","author":"G Dantzig","year":"1948","unstructured":"Dantzig, G.: Programming in a Linear Structure. Comptroller. USAF, Washington, DC (1948)"},{"key":"9336_CR20","doi-asserted-by":"crossref","DOI":"10.1515\/9781400884179","volume-title":"Linear Proxramming and Extensions","author":"G Dantzig","year":"1963","unstructured":"Dantzig, G.: Linear Proxramming and Extensions. Princeton University Press, Princeton (1963)"},{"key":"9336_CR21","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10732-007-9021-7","volume":"13","author":"J Eckstein","year":"2007","unstructured":"Eckstein, J., Nediak, M.: Pivot, cut and dive: a heuristic for 0\u20131 mixed integer programming. J. Heuristics 13, 471\u2013503 (2007)","journal-title":"J. Heuristics"},{"issue":"4","key":"9336_CR22","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1016\/j.cie.2013.01.012","volume":"64","author":"RZ Farahani","year":"2013","unstructured":"Farahani, R.Z., Hekmatfar, M., Arabani, A.B., Nikbakhsh, E.: Hub location problems: a review of models, classification, solution techniques, and applications. Comput. Ind. Eng. 64(4), 1096\u20131109 (2013)","journal-title":"Comput. Ind. Eng."},{"key":"9336_CR23","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. 98, 23\u201347 (2003)","journal-title":"Math. Program."},{"key":"9336_CR24","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1016\/j.cor.2006.08.004","volume":"35","author":"M Fischetti","year":"2008","unstructured":"Fischetti, M., Lodi, A.: Repairing mip infeasibility through local branching. Comput. Oper. Res. 35, 1436\u20131445 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9336_CR25","first-page":"738","volume-title":"Wiley Encyclopedia of Operations Research and Management Science","author":"M Fischetti","year":"2011","unstructured":"Fischetti, M., Lodi, A.: Heuristics in mixed integer programming. In: Cochran, J.J. (ed.) Wiley Encyclopedia of Operations Research and Management Science, vol. 8, pp. 738\u2013747. Wiley, New York (2011)"},{"issue":"6","key":"9336_CR26","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s10732-014-9266-x","volume":"20","author":"M Fischetti","year":"2014","unstructured":"Fischetti, M., Monaci, M.: Proximity search for 0\u20131 mixed-integer convex programming. J. Heuristics 20(6), 709\u2013731 (2014)","journal-title":"J. Heuristics"},{"issue":"1","key":"9336_CR27","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104(1), 91\u2013104 (2005)","journal-title":"Math. Program."},{"key":"9336_CR28","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1287\/opre.16.6.1212","volume":"16","author":"F Glover","year":"1968","unstructured":"Glover, F.: A note on linear programming and integer infeasibility. Oper. Res. 16, 1212\u20131216 (1968)","journal-title":"Oper. Res."},{"key":"9336_CR29","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8, 156\u2013166 (1977a)","journal-title":"Decis. Sci."},{"issue":"1","key":"9336_CR30","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156\u2013166 (1977b)","journal-title":"Decis. Sci."},{"key":"9336_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0305-0483(78)90032-4","volume":"6","author":"F Glover","year":"1978","unstructured":"Glover, F.: Parametric branch and bound. OMEGA, Int. J. Manag. Sci. 6, 1\u20139 (1978)","journal-title":"OMEGA, Int. J. Manag. Sci."},{"issue":"5","key":"9336_CR32","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"key":"9336_CR33","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01719256","volume":"17","author":"F Glover","year":"1995","unstructured":"Glover, F.: Scatter search and star-paths: beyond the genetic metaphor. OR Spektrum 17, 125\u2013137 (1995a)","journal-title":"OR Spektrum"},{"key":"9336_CR34","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.7.4.426","volume":"7","author":"F Glover","year":"1995","unstructured":"Glover, F.: Tabu thresholding: Improved search by nonmonotonic trajectories. ORSA J. Comput. 7, 426\u2013442 (1995b)","journal-title":"ORSA J. Comput."},{"key":"9336_CR35","doi-asserted-by":"crossref","unstructured":"Glover, F.: Adaptive memory projection methods for integer programming. In: Metaheuristic Optimization Via Memory and Evolution, pp. 425\u2013440. Springer (2005)","DOI":"10.1007\/0-387-23667-8_19"},{"key":"9336_CR36","doi-asserted-by":"crossref","first-page":"2449","DOI":"10.1016\/j.cor.2005.07.009","volume":"33","author":"F Glover","year":"2006","unstructured":"Glover, F.: Parametric tabu-search for mixed integer programs. Comput. Oper. Res. 33, 2449\u20132494 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9336_CR37","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1009631530787","volume":"3","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: General purpose heuristics for integer programming-part ii. J. Heuristics 3, 161\u2013179 (1997)","journal-title":"J. Heuristics"},{"key":"9336_CR38","first-page":"1","volume":"1","author":"F Glover","year":"2010","unstructured":"Glover, F., Hanafi, S.: Metaheuristic search with inequalities and target objectives for mixed binary optimization-part i: exploiting proximity. Int. J. Appl. Metaheuristic Comput. (IJAMC) 1, 1\u201315 (2010a)","journal-title":"Int. J. Appl. Metaheuristic Comput. (IJAMC)"},{"issue":"2","key":"9336_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/jamc.2010040101","volume":"1","author":"F Glover","year":"2010","unstructured":"Glover, F., Hanafi, S.: Metaheuristic search with inequalities and target objectives for mixed binary optimization-part ii: Exploiting reaction and resistance. Int. J. Appl. Metaheuristic Comput. (IJAMC) 1(2), 1\u201317 (2010b)","journal-title":"Int. J. Appl. Metaheuristic Comput. (IJAMC)"},{"key":"9336_CR40","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","volume":"41","author":"F Glover","year":"1993","unstructured":"Glover, F., Taillard, E., de Werra, D.: A user\u2019s guide to tabu search. Ann. Oper. Res. 41, 3\u201328 (1993)","journal-title":"Ann. Oper. Res."},{"key":"9336_CR41","first-page":"299","volume-title":"OR Computing Tools for Modeling","author":"F Glover","year":"2000","unstructured":"Glover, F., L\u00f8kketangen, A., Woodruff, D.L.: OR computing tools for modeling, optimization and simulation: interfaces in computer science and operations research. In: Laguna, M., Gonzlez-Velarde, J. (eds.) OR Computing Tools for Modeling, pp. 299\u2013317. Kluwer Academic Publishers, Dordrecht (2000)"},{"issue":"1\u20132","key":"9336_CR42","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s13675-013-0007-y","volume":"1","author":"M Guzelsoy","year":"2013","unstructured":"Guzelsoy, M., Nemhauser, G., Savelsbergh, M.: Restrict-and-relax search for 0\u20131 mixed-integer programs. EURO J. Comput. Optim. 1(1\u20132), 201\u2013218 (2013)","journal-title":"EURO J. Comput. Optim."},{"key":"9336_CR43","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10479-009-0546-z","volume":"183","author":"S Hanafi","year":"2011","unstructured":"Hanafi, S., Wilbaut, C.: Improved convergent heuristics for the 0\u20131 multidimensional knapsack problem. Ann. OR 183, 125\u2013142 (2011)","journal-title":"Ann. OR"},{"key":"9336_CR44","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.endm.2010.05.096","volume":"36","author":"S Hanafi","year":"2010","unstructured":"Hanafi, S., Lazi\u0107, J., Mladenovi\u0107, N.: Variable neighbourhood pump heuristic for 0\u20131 mixed integer programming feasibility. Electron. Notes Discrete Math. 36, 759\u2013766 (2010a)","journal-title":"Electron. Notes Discrete Math."},{"key":"9336_CR45","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1016\/j.endm.2010.05.112","volume":"36","author":"S Hanafi","year":"2010","unstructured":"Hanafi, S., Lazi\u0107, J., Mladenovi\u0107, N., Wilbaut, C., Cr\u00e9vits, I.: Hybrid variable neighbourhood decomposition search for 0\u20131 mixed integer programming problem. Electron. Notes Discrete Math. 36, 883\u2013890 (2010b)","journal-title":"Electron. Notes Discrete Math."},{"issue":"10","key":"9336_CR46","doi-asserted-by":"crossref","first-page":"3034","DOI":"10.1016\/j.cor.2005.02.033","volume":"33","author":"P Hansen","year":"2006","unstructured":"Hansen, P., Mladenovi\u0107, N., Urosevi\u0107, D.: Variable neighborhood search and local branching. Comput. Oper. Res. 33(10), 3034\u20133045 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9336_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/s13675-016-0075-x","author":"P Hansen","year":"2016","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. (2016). doi:\n                        10.1007\/s13675-016-0075-x","journal-title":"EURO J. Comput. Optim."},{"issue":"3","key":"9336_CR48","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K Holmberg","year":"2000","unstructured":"Holmberg, K., Yuan, D.: A lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48(3), 461\u2013481 (2000)","journal-title":"Oper. Res."},{"issue":"1","key":"9336_CR49","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ejor.2005.06.044","volume":"176","author":"A Imai","year":"2007","unstructured":"Imai, A., Nishimura, E., Current, J.: A lagrangian relaxation-based heuristic for the vehicle routing with full container load. Eur. J. Oper. Res. 176(1), 87\u2013105 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9336_CR50","unstructured":"Jena, S.D., Cordeau, J.F., Gendron, B.: Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities. Tecnical report CIRRELT\u20142014\u201321 (2014)"},{"key":"9336_CR51","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1016\/j.cor.2009.09.010","volume":"37","author":"J Lazi\u0107","year":"2010","unstructured":"Lazi\u0107, J., Hanafi, S., Mladenovi\u0107, N., Urosevi\u0107, D.: Variable neighbourhood decomposition search for 0\u20131 mixed integer programs. Comput. Oper. Res. 37, 1055\u20131067 (2010)","journal-title":"Comput. Oper. Res."},{"key":"9336_CR52","doi-asserted-by":"publisher","unstructured":"Lazi\u0107, J., Todosijevi\u0107, R., Hanafi, S., Mladenovi\u0107, N.: Variable and single neighbourhood diving for MIP feasibility. Yugoslav J. Oper. Res. (2014). doi:\n                        10.2298\/YJOR140417027L","DOI":"10.2298\/YJOR140417027L"},{"key":"9336_CR53","volume-title":"Mixed Integer Nonlinear Programming","author":"J Lee","year":"2011","unstructured":"Lee, J., Leyffer, S.: Mixed Integer Nonlinear Programming, vol. 154. Springer, Berlin (2011)"},{"issue":"3","key":"9336_CR54","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0969-6016(94)90031-0","volume":"1","author":"A L\u00f8kketangen","year":"1994","unstructured":"L\u00f8kketangen, A., J\u00f6rnsten, K., Stor\u00f8y, S.: Tabu search within a pivot and complement framework. Int. Trans. Oper. Res. 1(3), 305\u2013316 (1994)","journal-title":"Int. Trans. Oper. Res."},{"key":"9336_CR55","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1016\/S0377-2217(97)00295-6","volume":"106","author":"A Lokketangen","year":"1998","unstructured":"Lokketangen, A., Glover, F.: Solving zero-one mixed integer programming problems using tabu search. Eur. J. Oper. Res. 106, 624\u2013658 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9336_CR56","volume-title":"XMP Technical Reference Manual","author":"R Marsten","year":"1987","unstructured":"Marsten, R.: XMP Technical Reference Manual. Dept. of Management Information Systems, University of Arizona, Tucson, AZ (1987)"},{"issue":"6","key":"9336_CR57","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10951-010-0222-9","volume":"14","author":"L M\u00f6nch","year":"2011","unstructured":"M\u00f6nch, L., Fowler, J.W., Dauz\u00e8re-P\u00e9r\u00e8s, S., Mason, S.J., Rose, O.: A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. J. Sched. 14(6), 583\u2013599 (2011)","journal-title":"J. Sched."},{"key":"9336_CR58","volume-title":"Production Planning by Mixed Integer Programming","author":"Y Pochet","year":"2006","unstructured":"Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer Science & Business Media, New York (2006)"},{"key":"9336_CR59","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/0-387-23529-9_5","volume-title":"The Next Wave in Computing, Optimization, and Decision Technologies","author":"TK Ralphs","year":"2005","unstructured":"Ralphs, T.K., G\u00fczelsoy, M.: The symphony callable library for mixed integer programming. In: Golden, B.L., Raghavan, S., Wasil, E.A. (eds.) The Next Wave in Computing, Optimization, and Decision Technologies, pp. 61\u201376. Springer, New York (2005)"},{"issue":"3","key":"9336_CR60","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2010.09.010","volume":"211","author":"C Rego","year":"2011","unstructured":"Rego, C., Gamboa, D., Glover, F., Osterman, C.: Traveling salesman problem heuristics: leading methods, implementations and latest advances. Eur. J. Oper. Res. 211(3), 427\u2013441 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9336_CR61","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.cor.2010.07.004","volume":"38","author":"LH Sacchi","year":"2011","unstructured":"Sacchi, L.H., Armentano, V.A.: A computational study of parametric tabu search for 0\u20131 mixed integer programs. Comput. Oper. Res. 38(2), 464\u2013473 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9336_CR62","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1287\/mnsc.38.2.263","volume":"38","author":"RM Saltzman","year":"1992","unstructured":"Saltzman, R.M., Hillier, F.S.: A heuristic ceiling point algorithm for general integer linear programming. Manag. Sci. 38(2), 263\u2013283 (1992)","journal-title":"Manag. Sci."},{"issue":"3","key":"9336_CR63","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0377-2217(78)90093-0","volume":"2","author":"A Soyster","year":"1978","unstructured":"Soyster, A., Lev, B., Slivka, W.: Zero-one programming with many variables and few constraints. Eur. J. Oper. Res. 2(3), 195\u2013201 (1978)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9336_CR64","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.51.3.487.14949","volume":"51","author":"H Stadtler","year":"2003","unstructured":"Stadtler, H.: Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Oper. Res. 51(3), 487\u2013502 (2003)","journal-title":"Oper. Res."},{"issue":"2","key":"9336_CR65","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1016\/j.ejor.2005.06.029","volume":"175","author":"FMB Toledo","year":"2006","unstructured":"Toledo, F.M.B., Armentano, V.A.: A lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines. Eur. J. Oper. Res. 175(2), 1070\u20131083 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9336_CR66","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1007\/s10732-015-9295-0","volume":"21","author":"CFM Toledo","year":"2015","unstructured":"Toledo, C.F.M., da Silva, Arantes M., Hossomi, M.Y.B., Fran\u00e7a, P.M., Akartunal\u0131, K.: A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems. J. Heuristics 21(5), 687\u2013717 (2015)","journal-title":"J. Heuristics"},{"issue":"1","key":"9336_CR67","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231(1), 1\u201321 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"9336_CR68","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.ejor.2008.01.044","volume":"195","author":"C Wilbaut","year":"2009","unstructured":"Wilbaut, C., Hanafi, S.: New convergent heuristics for 0\u20131 mixed integer programming. Eur. J. Oper. Res. 195, 62\u201374 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9336_CR69","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.ejor.2008.11.036","volume":"199","author":"C Wilbaut","year":"2009","unstructured":"Wilbaut, C., Salhi, S., Hanafi, S.: An iterative variable-based fixation heuristic for the 0\u20131 multidimensional knapsack problem. Eur. J. Oper. Res. 199(2), 339\u2013348 (2009)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-017-9336-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9336-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9336-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,7]],"date-time":"2017-07-07T16:55:44Z","timestamp":1499446544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-017-9336-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,19]]},"references-count":69,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["9336"],"URL":"https:\/\/doi.org\/10.1007\/s10732-017-9336-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,19]]}}}