A note on the continuous mixing set

Operations Research Letters

Volumn 36, Issue 6, 2008, Pages 726-733

  Zhao, M ^a   de Farias Jr , I R ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Texas Tech University   (United States)

Author keywords

Branch and cut; Mixed integer programming; Polyhedral combinatorics; Simple mixed integer set

Indexed keywords

MIXING;

BRANCH-AND-CUT; CONTINUOUS MIXING; MIXED-INTEGER PROGRAMMING; POLYHEDRAL COMBINATORICS; SIMPLE MIXED-INTEGER SET;

INTEGER PROGRAMMING;

EID: 54249086085     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2008.08.001     Document Type: Article

References (19)

1. Balas E. Intersection cuts - a new type of cutting planes for integer programming. Operations Research 19 (1971) 19-39
2. Balas E. Facets of the knapsack polytope. Mathematical Programming 8 (1975) 146-164
3. Balas E. Disjunctive programming. Annals of Discrete Mathematics 5 (1979) 3-51
4. Cook W., Kannan R., and Schrijver A. Chvátal closures for mixed integer programming problems. Mathematical Programming 47 (1990) 155-174
5. P.M. Christophel, Separation of mixing inequalities in a mixed-integer programming solver, Technical Report, DS&OR Paper 0705, University of Paderborn, Germany, 2008
6. M. Conforti, M. di Summa, L.A. Wolsey, The intersection of continuous mixing polyhedra and the continuous mixing polyhedron with flows, Technical Report, Catholic University of Louvain, Belgium, 2007
7. M. di Summa, The mixing set with divisible capacities, Technical Report, University of Padua, Italy, 2007
8. A. Fügenschuh, A. Martin, Computational integer programming and cutting planes, Technical Report, Darmstadt University of Technology, Germany, 2002
9. R.E. Gomory, An algorithm for the mixed integer problem, Technical Report RM-2597, The RAND Corporation, 1960
10. Günlük O., and Pochet Y. Mixing mixed-integer inequalities. Mathematical Programming 90 (2001) 429-457
11. Hammer P.L., Johnson E.L., and Peled U.N. Facets of regular 0-1 polytopes. Mathematical Programming 8 (1975) 179-206
12. Marchand H., and Wolsey L.A. Aggregation and mixed integer rounding to solve MIPs. Operations Research 49 (2001) 363-371
13. Miller A.J., and Wolsey L.A. Tight formulations for some simple mixed integer programs and convex objective integer programs. Mathematical Programming 98 (2003) 73-88
14. Nemhauser G.L., and Wolsey L.A. A recursive procedure to generate all cuts for 0-1 mixed integer programs. Mathematical Programming 46 (1990) 379-390
15. van Vyve M. The continuous mixing polyhedron. Mathematics of Operations Research 30 (2005) 441-452
16. Wolsey L.A. Faces for a linear inequality in 0-1 variables. Mathematical Programming 8 (1975) 165-178
17. Wolsey L.A. Strong formulations for mixed integer programs: Valid inequalities and extended formulations. Mathematical Programming 97 (2003) 423-447
18. Zhao M., and de Farias Jr. I.R. The mixing-MIR set with divisible capacities. Mathematical Programming 115 (2008) 73-103
19. M. Zhao, I.R. de Farias Jr., The mixing-MIR set with two nondivisible capacities, Technical Report, Department of Industrial Engineering, Texas Tech University, 2008