The mixing set with divisible capacities

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

Volumn 5035 LNCS, Issue , 2008, Pages 435-449

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

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Compact extended formulations; Mixed integer programming; Mixing sets

Indexed keywords

AEROSPACE APPLICATIONS; C (PROGRAMMING LANGUAGE); COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; MIXING; NONLINEAR PROGRAMMING; OPTIMIZATION; SET THEORY;

INTERNATIONAL CONFERENCES; RATIONAL NUMBERS;

INTEGER PROGRAMMING;

EID: 45749116965     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68891-4_30     Document Type: Conference Paper

References (20)

1. Atamtürk, A.: Strong formulations of robust mixed 0-1 programming. Mathematical Programming 108, 235-250 (2006)
2. Balas, E.: Disjunctive programming: Properties of the convex hull of feasible points. Discrete Applied Mathematics 89, 3-44 (1998)
3. Conforti, M., Di Summa, M., Eisenbrand, F., Wolsey, L.A.: Network formulations of mixed-integer programs. CORE Discussion Paper, 2006/117, Université catholique de Louvain, Belgium. Mathematics of Operations Research (accepted, 2006)
4. Conforti, M., Wolsey, L.A.: Compact formulations as a union of polyhedra. Mathematical Programming (published online) (to appear, 2007)
5. Constantino, M., Miller, A.J., Van Vyve, M.: Mixing MIR inequalities with two divisible coefficients (manuscript, 2007)
6. Di Summa, M.: The mixing set with divisible capacities (manuscript, 2007)
7. Di Summa, M.: Formulations of Mixed-Integer Sets Defined by Totally Unimodular Constraint Matrices. PhD thesis, Università degli Studi di Padova, Italy (2008)
8. Ghouila-Houri, A.: Caractérisations des matrices totalement unimodulaires. In: Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences, Paris, vol. 254, pp. 1192-1194 (1962)
9. Günlük, O., Pochet, Y.: Mixing mixed-integer inequalities. Mathematical Programming 90, 429-457 (2001)
10. Henk, M., Weismantel, R.: Diophantine approximations and integer points of cones. Combinatorica 22, 401-408 (2002)
11. Marcotte, O.: The cutting stock problem and integer rounding. Mathematical Programming 33, 82-92 (1985)
12. Miller, A.J., Wolsey, L.A.: Tight formulations for some simple mixed integer programs and convex objective integer programs. Mathematical Programming 98, 73-88 (2003)
13. Pochet, Y., Weismantel, R.: The sequential knapsack polytope. SIAM Journal on Optimization 8, 248-264 (1998)
14. Pochet, Y., Wolsey, L.A.: Network design with divisible capacities: Aggregated flow and knapsack subproblems. In: Balas, E., Cornuéjols, G., Kannan, R. (eds.) Integer Programming and Combinatorial Optimization, pp. 324-336. Carnegie Mellon University (1992)
15. Pochet, Y., Wolsey, L.A.: Polyhedra for lot-sizing with Wagner-Whitin costs. Mathematical Programming 67, 297-323 (1994)
16. Pochet, Y., Wolsey, L.A.: Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation. Discrete Applied Mathematics 59, 57-74 (1995)
17. Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, Heidelberg (2006)
18. Van Vyve, M.: A Solution Approach of Production Planning Problems Based on Compact Formulations for Single-Item Lot-Sizing Models. PhD thesis, Faculté des Sciences Appliquées, Université catholique de Louvain, Belgium (2003)
19. Van Vyve, M.: Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity. Mathematical Programming 108, 53-77 (2006)
20. Zhao, M., de Farias Jr., I.R.: The mixing-MIR set with divisible capacities. Mathematical Programming (published online) (to appear, 2007)