期刊
JOURNAL OF HEURISTICS
卷 23, 期 4, 页码 165-206出版社
SPRINGER
DOI: 10.1007/s10732-017-9336-y
关键词
Mathematical programming; Heuristics; Metaheuristics; 0-1 Mixed integer program
资金
- ELSAT2020 project - European Union
- European Regional Development Fund
- French state
- Hauts de France Region Council
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据