STRENGTHENED DANTZIG CUTS INTEGER PROGRAMMING

被引：2

|

作者：

RUBIN, DS

GRAVES, RL

机构：

来源：

OPERATIONS RESEARCH | 1972年 / 20卷 / 01期

关键词：

D O I：

10.1287/opre.20.1.178

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：178 / &

相关论文

共 50 条

[21] Combinatorial benders' cuts for mixed-integer linear programming
Codato, Gianni
Fischetti, Matteo
OPERATIONS RESEARCH, 2006, 54 (04) : 756 - 766
[22] GENERATING CUTS IN INTEGER PROGRAMMING WITH FAMILIES OF SPECIAL ORDERED SETS
WILSON, JM
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 46 (01) : 101 - 108
[23] INTERSECTION CUTS - NEW TYPE OF CUTTING PLANES FOR INTEGER PROGRAMMING
BALAS, E
OPERATIONS RESEARCH, 1971, 19 (01) : 19 - +
[24] The follower optimality cuts for mixed integer linear bilevel programming problems
Mattia, Sara
SOFT COMPUTING, 2023, 27 (16) : 11529 - 11550
[25] Classical cuts for mixed-integer programming and branch-and-cut
Padberg, M
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2001, 53 (02) : 173 - 203
[26] Classical cuts for mixed-integer programming and branch-and-cut
Padberg, M
ANNALS OF OPERATIONS RESEARCH, 2005, 139 (01) : 321 - 352
[27] Classical cuts for mixed-integer programming and branch-and-cut
Manfred Padberg
Mathematical Methods of Operations Research, 2001, 53 : 173 - 203
[28] Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
Modaresi, Sina
Kilinc, Mustafa R.
Vielma, Juan Pablo
MATHEMATICAL PROGRAMMING, 2016, 155 (1-2) : 575 - 611
[29] Classical Cuts for Mixed-Integer Programming and Branch-and-Cut
Manfred Padberg
Annals of Operations Research, 2005, 139 : 321 - 352
[30] Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
Sina Modaresi
Mustafa R. Kılınç
Juan Pablo Vielma
Mathematical Programming, 2016, 155 : 575 - 611

← 1 2 3 4 5 →