| Article ID: | iaor20172772 |
| Volume: | 23 |
| Issue: | 4 |
| Start Page Number: | 165 |
| End Page Number: | 206 |
| Publication Date: | Aug 2017 |
| Journal: | Journal of Heuristics |
| Authors: | Hanafi Sad, Todosijevic Raca |
| Keywords: | programming: mathematical, simulation, combinatorial optimization, decision, scheduling, vehicle routing & scheduling, graphs, programming: linear |
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.