Incremental and encoding formulations for Mixed Integer Programming

Operations Research Letters

Volumn 41, Issue 6, 2013, Pages 654-658

  Yildiz, Sercan ^a   Vielma, Juan Pablo ^b,c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c University of Pittsburgh   (United States)

Author keywords

Disjunctive programming; Formulations; Mixed Integer Programming

Indexed keywords

BINARY VARIABLES; BRANCH AND BOUNDS; DISJUNCTIVE PROGRAMMING; FORMULATIONS; INCREMENTAL FORMULATION; MIXED INTEGER PROGRAMMING; PIECE-WISE LINEAR FUNCTIONS; SOLVER PERFORMANCE;

PIECEWISE LINEAR TECHNIQUES;

ENCODING (SYMBOLS);

EID: 84885356077     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2013.09.004     Document Type: Article

References (32)

1. W.P. Adams, and S.M. Henry Base-2 expansions for linearizing products of functions of discrete variables Operations Research 60 2012 1477 1490
2. J.A. Appleget, and R.K. Wood Explicit-Constraint Branching for Solving Mixed-Integer Programs Operations Research/Computer Science Interfaces Series vol. 12 2000 Kluwer 245 261
3. E. Balas On the convex-hull of the union of certain polyhedra Operations Research Letters 7 1988 279 283
4. E.M.L. Beale, J.A. Tomlin, Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables, in: OR 69: Proceedings of the Fifth International Conference on Operational Research, pp. 447-454.
5. C. Blair Representation for multiple right-hand sides Mathematical Programming 49 1990 1 5
6. D.L. Bricker Reformulation of special ordered sets for implicit enumeration algorithms with applications in nonconvex separable programming AIIE Transactions 9 1977 195 203
7. C.C.B. Cavalcante, C.C. deSouza, M.W.P. Savelsbergh, Y. Wang, and L.A. Wolsey Scheduling projects with labor constraints Discrete Applied Mathematics 112 2001 27 52 (Pubitemid 33676133)
8. G.B. Dantzig On the significance of solving linear-programming problems with some integer variables Econometrica 28 1960 30 44
9. G.B. Dantzig Linear Programming and Extensions 1963 Princeton University Press Princeton
10. B. Geißler, A. Martin, A. Morsi, and L. Schewe Using piecewise linear functions for solving MINLPs J. Lee, S. Leyffer, Mixed Integer Nonlinear Programming The IMA Volumes in Mathematics and its Applications vol. 154 2012 Springer 287 314
11. T. Ibaraki Integer programming formulation of combinatorial optimization problems Discrete Mathematics 16 1976 39 52
12. R.G. Jeroslow A simplification for some disjunctive formulations European Journal of Operational Research 36 1988 116 121
13. R.G. Jeroslow, and J.K. Lowe Modeling with integer variables Mathematical Programming Studies 22 1984 167 184
14. H.L. Li, and H.C. Lu Global optimization for generalized geometric programs with mixed free-sign variables Operations Research 57 2009 701 713
15. E.Y.H. Lin, and D.L. Bricker On the calculation of true and pseudo penalties in multiple choice integer programming European Journal of Operational Research 55 1991 228 236
16. E.Y.H. Lin, and D.L. Bricker Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming Computers & Operations Research 29 2002 1441 1446 (Pubitemid 34409656)
17. J.K. Lowe, Modelling with Integer Variables, Ph.D. Thesis, Georgia Institute of Technology, 1984.
18. J. Luedtke, S. Ahmed, and G.L. Nemhauser An integer programming approach for linear programs with probabilistic constraints Mathematical Programming 122 2010 247 272
19. H. Markowitz, and A. Manne On the solution of discrete programming problems Econometrica 25 1957 84 110
20. R.H. Möhring, A.S. Schulz, F. Stork, and M. Uetz On project scheduling with irregular starting time costs Operations Research Letters 28 2001 149 154 (Pubitemid 32610335)
21. W. Ogryczak A note on modeling multiple choice requirements for simple mixed integer programming solvers Computers & Operations Research 23 1996 199 205
22. M. Padberg Approximating separable nonlinear functions via mixed zero-one programs Operations Research Letters 27 2000 1 5
23. M.W. Padberg, and M.P. Rijal Location, Scheduling, Design and Integer Programming International Series in Operations Research & Management Science vol. 3 1996 Springer
24. D.M. Ryan, and B.A. Foster An integer programming approach to scheduling A. Wren, Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling 1981 North-Holland 269 280
25. D.C. Sommer, Computational experience with the ophelie mixed integer code, Talk presented at the International TIMS Conference, Houston, 1972.
26. C.C. Souza, L.A. Wolsey, Scheduling Projects with Labour Constraints, Relatório Técnico IC-97-22, IC - UNICAMP, 1997.
27. J.P. Vielma, Mixed integer linear programming formulation techniques, Optimization Online 2012, http://www.optimization-online.org/DB-HTML/2012/07/ 3539.html.
28. J.P. Vielma, S. Ahmed, and G.L. Nemhauser Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions Operations Research 58 2010 303 315
29. J.P. Vielma, S. Ahmed, and G.L. Nemhauser Mixed integer linear programming formulations for probabilistic constraints Operations Research Letters 40 2012 153 158
30. J.P. Vielma, A.B. Keha, and G.L. Nemhauser Nonconvex, lower semicontinuous piecewise linear optimization Discrete Optimization 5 2008 467 488 (Pubitemid 351443135)
31. J.P. Vielma, and G.L. Nemhauser Modeling disjunctive constraints with a logarithmic number of binary variables and constraints Mathematical Programming 128 2011 49 72
32. D.L. Wilson, Polyhedral methods for piecewise-linear functions, Ph.D. Thesis, University of Kentucky, Lexington, KY, USA, 1998.