Skip to Main content Skip to Navigation
Journal articles

Mathematical programming based heuristics for the 0–1 MIP: a survey

Abstract : The 0–1 mixed integer programming problem is used for modeling many combinatorial problems, ranging from logical design to scheduling and routing as well as encompassing graph theory models for resource allocation and financial planning. This paper provides a survey of heuristics based on mathematical programming for solving 0–1 mixed integer programs (MIP). More precisely, we focus on the stand-alone heuristics for 0–1 MIP as well as those heuristics that use linear programming techniques or solve a series of linear programming models or reduced problems, deduced from the initial one, in order to produce a high quality solution of a considered problem. Our emphasis will be on how mathematical programming techniques can be used for approximate problem solving, rather than on comparing performances of heuristics.
Document type :
Journal articles
Complete list of metadata
Contributor : Kathleen TORCK Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 2:24:03 PM
Last modification on : Wednesday, March 9, 2022 - 4:06:01 PM




Said Hanafi, Raca Todosijević. Mathematical programming based heuristics for the 0–1 MIP: a survey. Journal of Heuristics, Springer Verlag, 2017, 23 (4), pp.165-206. ⟨10.1007/s10732-017-9336-y⟩. ⟨hal-03401722⟩



Record views