Classical cuts for mixed-integer programming and branch-and-cut

被引：7

作者：

Padberg, M

机构：

[1] 13007 Marseille, 17, Rue Vendôme

来源：

MATHEMATICAL METHODS OF OPERATIONS RESEARCH | 2001年 / 53卷 / 02期

关键词：

mixed-integer programming; cutting planes; Gomory cuts; branch-and-cut;

D O I：

10.1007/s001860100120

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We review classical valid linear inequalities for mixed-integer programming, i.e., Gomory's fractional and mixed-integer cuts, and discuss their use in branch-and-cut. In particular, a generalization of the recent mixed-integer rounding (MIR) inequality and a sufficient condition for the global validity of classical cuts after branching has occurred are derived.

引用

页码：173 / 203

页数：31

共 50 条

[1] Classical cuts for mixed-integer programming and branch-and-cut
Padberg, M
[J]. ANNALS OF OPERATIONS RESEARCH, 2005, 139 (01) : 321 - 352
[2] Classical cuts for mixed-integer programming and branch-and-cut
Manfred Padberg
[J]. Mathematical Methods of Operations Research, 2001, 53 : 173 - 203
[3] Classical Cuts for Mixed-Integer Programming and Branch-and-Cut
Manfred Padberg
[J]. Annals of Operations Research, 2005, 139 : 321 - 352
[4] A branch-and-cut algorithm for Mixed-Integer Bilinear Programming
Fischetti, Matteo
Monaci, Michele
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (02) : 506 - 514
[5] Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
Sen, S
Sherali, HD
[J]. MATHEMATICAL PROGRAMMING, 2006, 106 (02) : 203 - 223
[6] Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
Suvrajeet Sen
Hanif D. Sherali
[J]. Mathematical Programming, 2006, 106 : 203 - 223
[7] Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts
Balcan, Maria-Florina
Prasad, Siddharth
Sandholm, Tuomas
Vitercik, Ellen
[J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35, NEURIPS 2022, 2022,
[8] A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
Kobayashi, Ken
Takano, Yuich
[J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2020, 75 (02) : 493 - 513
[9] A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
Ken Kobayashi
Yuich Takano
[J]. Computational Optimization and Applications, 2020, 75 : 493 - 513
[10] Generalized branch-and-cut framework for mixed-integer nonlinear optimization problems
Kesavan, P
Barton, PI
[J]. COMPUTERS & CHEMICAL ENGINEERING, 2000, 24 (2-7) : 1361 - 1366

← 1 2 3 4 5 →