Tight formulations for some simple mixed integer programs and convex objective integer programs

Mathematical Programming

Volumn 98, Issue 1-3, 2003, Pages 73-88

  Miller, Andrew J ^a,b   Wolsey, Laurence A ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b University of Wisconsin Madison   (United States)

Author keywords

Extended formulations; Mixed integer programming; Valid inequalities

Indexed keywords

BASIC BUILDING BLOCK; EXTENDED FORMULATIONS; LOT SIZING PROBLEMS; MIXED INTEGER PROGRAMMING; MIXED-INTEGER PROGRAMS; MIXED-INTEGER SETS; POLYHEDRAL STRUCTURES; VALID INEQUALITY;

MATHEMATICAL PROGRAMMING; SOFTWARE ENGINEERING;

INTEGER PROGRAMMING;

EID: 31144458012     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-003-0397-3     Document Type: Conference Paper

References (19)

1. Agra, A., Constantino, M.: Polyhedral descriptionofbasic knapsack problems with a continuous variable, University of Lisbon. 2001
2. Ahuja, R.L., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ. 1993
3. Atamtürk, A., Nemhauser, G.L., Savelsbergh, M.W.P.: The Mixed Vertex Packing Problem. Math. Program. 89, 35-53 (2000)
4. Atamtürk, A., Rajan, D.: On splittable and unsplittable flow capacitated network design arc-set polyhe-dra. Mathematical Programming 92, 315-333 (2002)
5. Constantino, M.: Private communication, 2002
6. Fleischmann, B.: The discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. 44, 337-348 (1990)
7. Gomory, R.E.: An algorithm for the mixed integer problem. The RAND Corporation. American Mathematical Society, RM-2597. 1960
8. Günlük, O., Pochet, Y.: Mixing MIR inequalities for mixed integer programs. Math. Program. 90, 429-458 (2001)
9. Hochbaum, D.S., Shantikumar, J.G.: Convex separable optimization is not much harder than linear optimization. Journal of ACM 37, 843-862 (1990)
10. Magnanti, T.L., Mirchandani, P., Vachani, R.: The convex hull of two core capacitated network design problems. Math. Program. 60, 233-250 (1993)
11. Marchand, H., Wolsey, L.A.: Aggregation and Mixed Integer Rounding to solve MIPs. Oper. Res. 49, 363-371 (2001)
12. Miller, A., Wolsey, L.A.: Tight MIP Formulations for Multi-Item Discrete Lot-Sizing Problems, CORE, Louvain-la-Neuve, Belgium. To appear in Operations Research. (2002)
13. Pereira, O., Wolsey, L.A.:On theWagner-Whitin lot-sizing polyhedron. Math.ofOper. Res.26, 591-600 (2001)
14. Pochet, Y., Wolsey, L.A.: Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Program. 67, 297-323 (1994)
15. Pochet, Y., Wolsey, L.A.: Integer Knapsacks and Flow Covers with Divisible Coefficients: Polyhedra, Optimization and Separation. Discrete Applied Mathematics 59, 57-74 (1995)
16. Salkin, H.M.: Integer Programming. Addison Wesley, Reading, Mass. 1975
17. van Eijl, C.A., van Hoesel, C.P.M.: On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs, Operations Research Letters 20, 7-13 (1997)
18. van Hoesel, C.P.M., Kuik, R., Salomon, M., van Wassenhove, L.N.: The single item discrete lot-sizing and scheduling problem: optimization by linear and dynamic programming. Discrete Appl. Math. 48, 289-303 (1994)
19. White, W.: On Gomory's mixed integer algorithm. Senior's thesis, Princeton University. 1961