The intersection of continuous mixing polyhedra and the continuous mixing polyhedron with flows

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4513 LNCS, Issue , 2007, Pages 352-366

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

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Integer programming

Indexed keywords

INTEGER PROGRAMMING; INVENTORY CONTROL; LINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; THEOREM PROVING;

LOT SIZING PROBLEMS; POLYNOMIAL TIME;

PROBLEM SOLVING;

EID: 38049035401     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72792-7_27     Document Type: Conference Paper

References (7)

1. Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Invited paper, Discrete Appl. Math. 89 (1988) 1-44
2. Conforti, M., Di Summa, M., Wolsey, L. A.: The mixing set with flows. CORE DP 2005/92, Université catholique de Louvain. SIAM J. Discret. Math, (to appear)
3. Conforti, M., Wolsey, L. A.: Compact formulations as a union of polyhedra. CORE DP 2005/62, Université catholique de Louvain. Math. Program. (to appear)
4. Ghouila-Houri, A.: Caractérisations des matrices totalement unimodulaires. C. R. Acad. Sci. Paris 254 (1968) 155-163
5. Miller, A. J., Wolsey, L. A.: Tight formulations for some simple mixed integer programs and convex objective integer programs. Math. Program. B 98 (2003) 73-88
6. Van Vyve, M.: A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. Ph. D. thesis, Faculté des Sciences Appliquées, Université catholique de Louvain (2003)
7. Van Vyve, M.: The continuous mixing polyhedron. Math. Oper. Res. 30 (2005) 441-452