Two row mixed-integer cuts via lifting

Mathematical Programming

Volumn 124, Issue 1-2, 2010, Pages 143-174

  Dey, Santanu S ^a   Wolsey, Laurence A ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Cutting planes; Infinite group relaxation; Mixed integer programs

Indexed keywords

CONTINUOUS VARIABLES; CONVEX SET; CUTTING PLANES; INFINITE GROUPS; INTEGER POINT; INTEGER VARIABLES; INTERSECTION CUT; LIFTING FUNCTIONS; MIXED INTEGER; MIXED-INTEGER CUTS; MIXED-INTEGER PROGRAMS; NONNEGATIVE INTEGERS; SPLIT CUTS; SUFFICIENT CONDITIONS; TWO EQUATION; VALID INEQUALITY;

DRUG PRODUCTS PLANTS; SET THEORY;

INTEGER PROGRAMMING;

EID: 77955172989     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0362-x     Document Type: Article

References (31)

1. Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Cutting planes from two rows of a simplex tableau. In: Fischetti, M., Williamson, D.P. (eds.) Proceedings 12th Conference on Integer Programming and Combinatorial Optimization, pp. 1-15. Springer (2007)
2. J. Aráoz L. Evans R.E. Gomory E.L. Johnson 2003 Cyclic group and knapsack facets Math. Prog. 96 377 408 1082.90094 10.1007/s10107-003-0390-x (Pubitemid 44757845)
3. E. Balas 1979 Disjunctive programming Ann. Discrete Math. 5 3 51 0409.90061 10.1016/S0167-5060(08)70342-X 558566
4. E. Balas 1971 Intersection cuts-a new type of cutting planes for integer programming Oper. Res. 19 19 39 0219.90035 10.1287/opre.19.1.19 290793
5. E. Balas R. Jeroslow 1980 Strengthening cuts for mixed integer programs Eur. J. Oper. Res. 4 224 234 0439.90064 10.1016/0377-2217(80)90106-X 568924 (Pubitemid 10480129)
6. Borozan, V., Cornuéjols, G.: Minimal valid inequalities for integer constraints. http://integer.tepper.cmu.edu (2007)
7. W.J. Cook R. Kannan A. Schrijver 1990 Chvátal closures for mixed integer programming problems Math. Prog. 47 155 174 0711.90057 10.1007/BF01580858 1059391
8. G. Cornuéjols Y. Li 2001 Elementary closures for integer programs Oper. Res. Lett. 28 1 8 1108.90326 10.1016/S0167-6377(00)00067-5 1810284 (Pubitemid 32139238)
9. Cornuéjols, G., Margot, F.: On the facets of mixed integer programs with two integer variables and two constraints. To appear in Math. Prog. (2008)
10. G. Cornuéjols Y. Li D. Vandenbussche 2003 K-cuts: a variation of Gomory mixed integer cuts from the LP tableau INFORMS J. Comput. 15 385 396 10.1287/ijoc.15.4.385.24893 2019287 (Pubitemid 39042716)
11. S. Dash O. Günlük 2006 Valid inequalities based on simple mixed-integer sets Math. Prog. 105 29 53 1085.90034 10.1007/s10107-005-0599-y (Pubitemid 41705517)
12. Dash, S., Günlük, O.: On the strength of Gomory mixed-integer cuts as group cuts. Technical Report RC23967, IBM Research report (2006b)
13. Dey, S.S., Richard, J.-P.P.: Sequential-merge facets for two-dimensional group problems. In: Fischetti, M., Williamson, D.P. (eds.) Proceedings 12th Conference on Integer Programming and Combinatorial Optimization, pp. 30-42. Springer (2007)
14. S.S. Dey J.-P.P. Richard 2008 Facets of two-dimensional infinite group problems Math. Oper. Res. 33 140 166 1190.90105 10.1287/moor.1070.0283 2393545
15. Dey, S.S., Wolsey, L.A.: Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. In: Lodi, A., Panconesci, A., Rinaldi, G. (eds.) Proceedings 13th Conference on Integer Programming and Combinatorial Optimization, pp. 463-475. Springer (2007)
16. Dey, S.S., Wolsey, L.A.: Two row mixed integer cuts via lifting. Technical Report 30, CORE DP, Université catholique de Louvain, Louvain-la-Neuve, Belgium (2008)
17. M. Fischetti C. Saturni 2007 Mixed integer cuts from cyclic groups Math. Prog. 109 27 53 05131063 10.1007/s10107-006-0726-4 2291591 (Pubitemid 44874465)
18. R.E. Gomory 1969 Some polyhedra related to combinatorial problems Linear Algebra Appl. 2 451 558 0184.23103 10.1016/0024-3795(69)90017-2 256718
19. Gomory, R.E.: An algorithm for the mixed-integer problem. Technical Report RM-2597, Rand Report (1960)
20. R.E. Gomory E.L. Johnson 1972 Some continuous functions related to corner polyhedra, part I Math. Prog. 3 23 85 0246.90029 10.1007/BF01584976 479415
21. R.E. Gomory E.L. Johnson 1972 Some continuous functions related to corner polyhedra, part II Math. Prog. 3 359 389 0254.90036 10.1007/BF01585008 479416
22. R.E. Gomory E.L. Johnson 2003 T-space and cutting planes Math. Prog. 96 341 375 1082.90144 10.1007/s10107-003-0389-3 1993052 (Pubitemid 44757844)
23. R.E. Gomory E.L. Johnson L. Evans 2003 Corner polyhedra and their connection with cutting planes Math. Prog. 96 321 339 1082.90145 10.1007/s10107-003-0388-4 1993051 (Pubitemid 44757843)
24. E.L. Johnson 1974 On the group problem for mixed integer programming Math. Prog. Study 2 137 179
25. E.L. Johnson 1981 Characterization of facets for multiple right-hand choice linear programs Math. Prog. Study 14 112 142 0449.90070
26. Lovász L.: Geometry of numbers and integer programming. In: Iri, M., Tanabe, K. (eds) Mathematical Programming: Recent Developments and Applications, Kluwer, Dordrecht (1989)
27. L.A. Miller Y. Li J.-P.P. Richard 2008 New facets for finite and infinite group problems from approximate lifting Naval Res. Logis. 55 172 191 1152.90664 10.1002/nav.20275 2369575 (Pubitemid 351421127)
28. G.L. Nemhauser L.A. Wolsey 1990 A recursive procedure to generate all cuts for 0-1 mixed integer programs Math. Prog. 46 379 390 0735.90049 10.1007/BF01585752 1054145
29. Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
30. Richard, J.-P.P., Li, Y., Miller, L.A.: Valid inequalities for MIPs and group polyhedra from approximate liftings. Math. Prog. 118, 253-277 (2009)
31. Rockafeller G.T.: Convex Analysis. Princeton University Press, New Jersey, NJ (1970)