Mixed Integer Linear Programming Formulation Techniques

被引：222
作者：
Vielma, Juan Pablo [1 ]
机构：
[1] MIT, Sloan Sch Management, Cambridge, MA 02139 USA
来源：
SIAM REVIEW | 2015年 / 57卷 / 01期
关键词：
mixed integer linear programming; disjunctive programming; MODELING DISJUNCTIVE CONSTRAINTS; BRANCH-AND-CUT; GLOBAL OPTIMIZATION; SIMPLEX ALGORITHM; BINARY VARIABLES; POOLING PROBLEMS; SEMICONTINUOUS CONSTRAINTS; MINIMIZATION MODELS; LOGARITHMIC NUMBER; BASE-2; EXPANSIONS;
D O I：
10.1137/130915303
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A wide range of problems can be modeled as Mixed Integer Linear Programming (MIP) problems using standard formulation techniques. However, in some cases the resulting MIP can be either too weak or too large to be effectively solved by state of the art solvers. In this survey we review advanced MIP formulation techniques that result in stronger and/or smaller formulations for a wide class of problems.
引用
收藏
页码：3 / 57
页数：55
相关论文
共 171 条
[1]   SCIP: solving constraint integer programs [J].
Achterberg, Tobias .
MATHEMATICAL PROGRAMMING COMPUTATION, 2009, 1 (01) :1-41
[2]   A simple recipe for concise mixed 0-1 linearizations [J].
Adam, WP ;
Forrester, RJ .
OPERATIONS RESEARCH LETTERS, 2005, 33 (01) :55-61
[3]  
Adams W.P., 2004, Discret. Optim, V1, P99
[4]   Linear forms of nonlinear expressions: New insights on old ideas [J].
Adams, Warren P. ;
Forrester, Richard J. .
OPERATIONS RESEARCH LETTERS, 2007, 35 (04) :510-518
[5]   Base-2 Expansions for Linearizing Products of Functions of Discrete Variables [J].
Adams, Warren P. ;
Henry, Stephen M. .
OPERATIONS RESEARCH, 2012, 60 (06) :1477-1490
[6]   A TIGHT LINEARIZATION AND AN ALGORITHM FOR ZERO-ONE QUADRATIC-PROGRAMMING PROBLEMS [J].
ADAMS, WP ;
SHERALI, HD .
MANAGEMENT SCIENCE, 1986, 32 (10) :1274-1290
[7]   JOINTLY CONSTRAINED BICONVEX PROGRAMMING [J].
ALKHAYYAL, FA ;
FALK, JE .
MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (02) :273-286
[8]   Forbidden Vertices [J].
Angulo, Gustavo ;
Ahmed, Shabbir ;
Dey, Santanu S. ;
Kaibel, Volker .
MATHEMATICS OF OPERATIONS RESEARCH, 2015, 40 (02) :350-360
[9]  
[Anonymous], 2007, THESIS TU BERLIN
[10]  
[Anonymous], 2012, Surveys in Operations Research and Management Science, DOI [DOI 10.1016/J.SORMS.2012.08.001, 10.1016/j.sorms.2012.08.001]
12345678910