Mixing sets linked by bidirected paths

SIAM Journal on Optimization

Volumn 21, Issue 4, 2011, Pages 1594-1613

  Di Summa, Marco ^a   Wolsey, Laurence A ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Convex hull descriptions; Lot sizing; Mixed integer programming; Mixing sets

Indexed keywords

ARC FLOW; CONTINUOUS VARIABLES; CONVEX HULL; EXPONENTIAL NUMBERS; EXTENDED FORMULATIONS; LOT SIZING; LOT SIZING PROBLEMS; MIXED-INTEGER PROGRAMMING; MIXED-INTEGER SETS; MIXING SET; MIXING SETS; OBJECTIVE FUNCTIONS; POLYNOMIAL-TIME; POLYNOMIAL-TIME SEPARATION ALGORITHMS;

ALGORITHMS; COMPUTATIONAL GEOMETRY; INTEGER PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

MIXING;

EID: 84856041888     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/100811799     Document Type: Article

References (22)

1. A. Atamtürk and D. Rajan, On splittable and unsplittable flow capacitated network design arcset polyhedra, Math. Program., 92 (2002), pp. 315-333. (Pubitemid 44744773)
2. M. Conforti, M. Di Summa, F. Eisenbrand, and L. A. Wolsey, Network formulations of mixed-integer programs, Math. Oper. Res., 34 (2009), pp. 194-209.
3. M. Conforti, M. Di Summa, and L. A. Wolsey, The intersection of continuous mixing polyhedra and the continuous mixing polyhedron with flows, in Integer Programming and Combinatorial Optimization, M. Fischetti and D. P. Williamson, eds., Lecture Notes in Comput. Sci. 4513, Springer, Berlin, 2007, pp. 352-366.
4. M. Conforti, M. Di Summa, and L. A. Wolsey, The mixing set with flows, SIAM J. Discrete Math., 21 (2007), pp. 396-407.
5. M. Conforti, M. Di Summa, and L. A. Wolsey, The mixing set with divisible capacities, in Integer Programming and Combinatorial Optimization, A. Lodi, A. Paconensi, and G. Rinaldi, eds., Lecture Notes in Comput. Sci. 5035, Springer, Berlin, 2008, pp. 435-449.
6. M. Conforti, B. Gerards, and G. Zambelli, Mixed-integer vertex covers on bipartite graphs, in Integer Programming and Combinatorial Optimization, M. Fischetti and D. P. Williamson, eds., Lecture Notes in Comput. Sci. 4513, Springer, Berlin, 2007, pp. 324-336.
7. M. Conforti and L. A. Wolsey, Compact formulations as a union of polyhedra, Math. Program., 114 (2008), pp. 277-289. (Pubitemid 351530905)
8. M. Conforti, L. A.Wolsey, and G. Zambelli, Projecting an extended formulation for mixedinteger covers on bipartite graphs, Math. Oper. Res., 35 (2010), pp. 603-623.
9. M. Constantino, A. J. Miller, and M. Van Vyve, Mixing MIR inequalities with two divisible coefficients, Math. Program., 123 (2010), pp. 451-483.
10. M. Di Summa, On a class of mixed-integer sets with a single integer variable, Oper. Res. Lett., 38 (2010), pp. 556-558.
11. F. Eisenbrand and T. Rothvoss, New hardness results for diophantine approximation, in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, I. Dinur, K. Jansen, S. Naor, and J. Rolim, eds., Lecture Notes in Comput. Sci. 5687, Springer, Berlin, 2009, pp. 98-110.
12. O. Günlük and Y. Pochet, Mixing mixed-integer inequalities, Math. Program., 90 (2001), pp. 429-457. (Pubitemid 33758916)
13. S. Küçükyavuz, On mixing sets arising in chance-constrained programming, Math. Program., to appear.
14. M. Loparic, Stronger Mixed 0-1 Models for Lot-Sizing Problems, Ph.D. thesis, Université catholique de Louvain, Louvain-la-Neuve, Belgium, 2001.
15. M. Loparic, Y. Pochet, and L. A. Wolsey, The uncapacitated lot-sizing problem with sales and safety stocks, Math. Program., 89 (2001), pp. 487-504. (Pubitemid 33758495)
16. T. L. Magnanti, P. Mirchandani, and R. Vachani, The convex hull of two core capacitated network design problems, Math. Program., 60 (1993), pp. 233-250.
17. A. J. Miller and L. A. Wolsey, Tight formulations for some simple mixed integer programs and convex objective integer programs, Math. Program. B, 98 (2003), pp. 73-88.
18. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, New York, 1988.
19. Y. Pochet and L. A. Wolsey, Polyhedra for lot-sizing with Wagner-Whitin costs, Math. Program., 67 (1994), pp. 297-323.
20. Y. Pochet and L. A. Wolsey, Production Planning by Mixed-Integer Programming, Springer, New York, 2006.
21. M. Van Vyve, The continuous mixing polyhedron, Math. Oper. Res., 30 (2005), pp. 441-452. (Pubitemid 43126841)
22. M. Zhao and I. R. de Farias, Jr, The mixing-MIR set with divisible capacities, Math. Program., 115 (2008), pp. 73-103. (Pubitemid 351702153)