Mixed n-step MIR inequalities: Facets for the n-mixing set

Discrete Optimization

Volumn 9, Issue 4, 2012, Pages 216-235

  Sanjeevi, Sujeevraja ^a   Kianfar, Kiavash ^a  

^a Texas AandM University   (United States)

Author keywords

Cutting planes; Mixed integer programming; Mixed n step MIR; Mixing; Multi module capacitated facility location; Multi module capacitated lot sizing

Indexed keywords

CAPACITATED LOT SIZING; CUTTING PLANES; FACILITY LOCATIONS; MIXED INTEGER PROGRAMMING; MIXED N-STEP MIR;

INTEGER PROGRAMMING;

MIXING;

EID: 84866350697     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2012.07.003     Document Type: Article

References (31)

1. O. Günlük, and Y. Pochet Mixing mixed-integer inequalities Mathematical Programming 90 2001 429 457
2. G.L. Nemhauser, and L.A. Wolsey A recursive procedure to generate all cuts for 0-1 mixed integer programs Mathematical Programming 46 1990 379 390
3. L.A. Wolsey Integer Programming 1998 Wiley New York, USA
4. M. Constantino, A.J. Miller, and M. Van Vyve Mixing MIR inequalities with two divisible coefficients Mathematical Programming 123 2009 451 483
5. A. Agra, and M. Constantino Mixing polyhedra with two non divisible coefficients Mathematical Programming 2011 Available Online First
6. M. Conforti, M. Di Summa, and L.A. Wolsey The mixing set with divisible capacities A. Lodi, A. Panconesi, G. Rinaldi, Integer Programming and Combinatorial Optimization, Vol. 5035 2008 Springer Berlin Heidelberg Berlin, Heidelberg 435 449
7. M. Zhao, and I. de Farias The mixing-MIR set with divisible capacities Mathematical Programming 115 2008 73 103
8. M. Conforti, and G. Zambelli The mixing set with divisible capacities: a simple approach Operations Research Letters 37 2009 379 383
9. M. Van Vyve The continuous mixing polyhedron Mathematics of Operations Research 30 2005 441 452
10. M. Zhao, and I. de Farias A note on the continuous mixing set Operations Research Letters 36 2008 726 733
11. M. Conforti, M. Di Summa, and L.A. Wolsey The mixing set with flows SIAM Journal on Discrete Mathematics 21 2007 396 407
12. M. Di Summa, L.A. Wolsey, Mixing sets linked by bidirected paths, CORE Discussion Papers 2010063, Université catholique de Louvain, Center for Operations Research and Econometrics, 2010.
13. S.S. Dey, and L.A. Wolsey Composite lifting of group inequalities and an application to two-row mixing inequalities Discrete Optimization 7 2010 256 268
14. S. Dash, and O. Günlük On mixing inequalities: rank, closure, and cutting-plane proofs SIAM Journal on Optimization 20 2009 1090 1109
15. S.S. Dey A note on the split rank of intersection cuts Mathematical Programming 130 2009 107 124
16. K. Kianfar, and Y. Fathi Generalized mixed integer rounding inequalities: facets for infinite group polyhedra Mathematical Programming 120 2009 313 346
17. A. Atamtürk, and K. Kianfar n-step mingling inequalities: new facets for the mixed-integer knapsack set Mathematical Programming 132 2012 79 98
18. K. Kianfar, and Y. Fathi Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions European Journal of Operational Research 207 2010 105 109
19. Y. Pochet, and L.A. Wolsey Lot-sizing with constant batches: formulation and valid inequalities Mathematics of Operations Research 18 1993 767 785
20. K. Aardal, Y. Pochet, and L.A. Wolsey Capacitated facility location: valid inequalities and facets Mathematics of Operations Research 20 1995 562 582
21. K. Aardal, Y. Pochet, and L.A. Wolsey Erratum: capacitated facility location: valid inequalities and facets Mathematics of Operations Research 21 1996 253 256
22. MIPLIB, 2010. http://miplib.zib.de/.
23. G.L. Nemhauser, and L.A. Wolsey Integer and Combinatorial Optimization 1988 Wiley New York, USA
24. S. Dash, M. Goycoolea, and O. Günlük Two-step MIR inequalities for mixed integer programs INFORMS Journal on Computing Articles in Advance 2009 1 14
25. L.A. Wolsey Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation Management Science 48 2002 1587 1602
26. A. Caprara, and A.N. Letchford On the separation of split cuts and related inequalities Mathematical Programming 94 2003 279 294
27. S. Dash, and O. Günlük Valid inequalities based on simple mixed-integer sets Mathematical Programming 105 2006 29 53
28. H. Marchand, and L.A. Wolsey Aggregation and mixed integer rounding to solve MIPs Operations Research 49 2001 363 371
29. IBM ILOG, CPLEX, 2011. http://www-01.ibm.com/software/integration/ optimization/cplex-optimizer/.
30. R. Fukasawa, and M. Goycoolea On the exact separation of mixed integer knapsack cuts Mathematical Programming 128 2009 19 41
31. A. Atamtürk, and J.C. Muñoz A study of the lot-sizing polytope Mathematical Programming 99 2004 443 465