Journal
JOURNAL OF HEURISTICS
Volume 23, Issue 4, Pages 165-206Publisher
SPRINGER
DOI: 10.1007/s10732-017-9336-y
Keywords
Mathematical programming; Heuristics; Metaheuristics; 0-1 Mixed integer program
Funding
- ELSAT2020 project - European Union
- European Regional Development Fund
- French state
- Hauts de France Region Council
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available