A Probabilistic Analysis of the Strength of the Split and Triangle Closures

被引:0
作者
Basu, Amitabh [1 ]
Cornuejols, Gerard [2 ]
Molinaro, Marco [2 ]
机构
[1] Univ Calif Davis, Davis, CA 95616 USA
[2] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
来源
INTEGER PROGRAMMING AND COMBINATORAL OPTIMIZATION, IPCO 2011 | 2011年 / 6655卷
基金
美国安德鲁·梅隆基金会;
关键词
INEQUALITIES; TABLEAU; CUTS;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we consider the relaxation of the corner polyhedron introduced by Andersen et al., which we denote by RCP. We study the relative strength of the split and triangle cuts of RCP's. Basu et al. showed examples where the split closure can be arbitrarily worse than the triangle closure under a 'worst-cost' type of measure. However, despite experiments carried out by several authors, the usefulness of triangle cuts in practice has fallen short of its theoretical strength. In order to understand this issue, we consider two types of measures between the closures: the 'worst-cost' one mentioned above, where we look at the weakest direction of the split closure, and the 'average-cost' measure which takes an average over all directions. Moreover, we consider a natural model for generating random RCP's. Our first result is that, under the worst-cost measure, a random RCP has a weak split closure with reasonable probability. This shows that the bad examples given by Basu et al. are not pathological cases. However, when we consider the average-cost measure, with high probability both split and triangle closures obtain a very good approximation of the RCP. The above result holds even if we replace split cuts by the simple split or Gomory cuts. This gives an indication that split/Gomory cuts are indeed as useful as triangle cuts.
引用
收藏
页码:27 / 38
页数:12
相关论文
共 14 条
[1]  
Andersen K, 2007, LECT NOTES COMPUT SC, V4513, P1
[2]   INTERSECTION CUTS - NEW TYPE OF CUTTING PLANES FOR INTEGER PROGRAMMING [J].
BALAS, E .
OPERATIONS RESEARCH, 1971, 19 (01) :19-+
[3]   Optimizing over the split closure [J].
Balas, Egon ;
Saxena, Anureet .
MATHEMATICAL PROGRAMMING, 2008, 113 (02) :219-240
[4]  
Basu A., PROBABILISTIC COMP S
[5]   On the relative strength of split, triangle and quadrilateral cuts [J].
Basu, Amitabh ;
Bonami, Pierre ;
Cornuejols, Gerard ;
Margot, Francois .
MATHEMATICAL PROGRAMMING, 2011, 126 (02) :281-314
[6]   Experiments with Two-Row Cuts from Degenerate Tableaux [J].
Basu, Amitabh ;
Bonami, Pierre ;
Cornuejols, Gerard ;
Margot, Francois .
INFORMS JOURNAL ON COMPUTING, 2011, 23 (04) :578-590
[7]   Minimal Valid Inequalities for Integer Constraints [J].
Borozan, Valentin ;
Cornuejols, Gerard .
MATHEMATICS OF OPERATIONS RESEARCH, 2009, 34 (03) :538-546
[8]   On the facets of mixed integer programs with two integer variables and two constraints [J].
Cornuejols, Gerard ;
Margot, Francois .
MATHEMATICAL PROGRAMMING, 2009, 120 (02) :429-456
[9]  
Del Pia A., 2010, WORKING PAPER
[10]  
Dey SS, 2010, LECT NOTES COMPUT SC, V6080, P424, DOI 10.1007/978-3-642-13036-6_32