On a class of mixed-integer sets with a single integer variable

Operations Research Letters

Volumn 38, Issue 6, 2010, Pages 556-558

  Di Summa, Marco ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

Convex hull descriptions; Mixed integer programming; Network flow matrices

Indexed keywords

CONVEX HULL; INTEGER VARIABLES; MIXED-INTEGER PROGRAMMING; MIXED-INTEGER SETS; NETWORK-FLOW MATRICES; NONZERO ENTRIES; UNIMODULAR MATRICES;

COMPUTATIONAL GEOMETRY; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR SYSTEMS;

MATRIX ALGEBRA;

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

References (14)

1. M. Conforti, M. Di Summa, F. Eisenbrand, and L.A. Wolsey Network formulations of mixed-integer programs Math. Oper. Res. 34 1 2009 194 209
2. M. Conforti, M. Di Summa, and L.A. Wolsey The intersection of continuous mixing polyhedra and the continuous mixing polyhedron with flows M. Fischetti, D.P. Williamson, Integer Programming and Combinatorial Optimization Lecture Notes in Computer Science vol. 4513 2007 Springer 352 366
3. M. Conforti, M. Di Summa, and L.A. Wolsey The mixing set with flows SIAM J. Discrete Math. 21 2 2007 396 407
4. M. Conforti, L.A. Wolsey, and G. Zambelli Projecting an extended formulation for mixed-integer covers on bipartite graphs Math. Oper. Res. 2010 10.1287/moor.1100.0454
5. W. Cook, R. Kannan, and A. Schrijver Chvtal closures for mixed integer programming problems Math. Program. 47 13 1990 155 174
6. M. Di Summa, Formulations of Mixed-Integer Sets with Totally Unimodular Constraint Matrices. PhD thesis, Universit degli Studi di Padova, Italy, 2008.
7. L.R. Ford, and D.R. Fulkerson Flows in Networks 1962 Princeton University Press
8. O. Gnlk, and Y. Pochet Mixing mixed-integer inequalities Math. Program. 90 3 2001 429 457
9. I. Heller, and C.B. Tompkins An extension of a theorem of Dantzig's H.W. Kuhn, A.W. Tucker, Linear Inequalities and Related Systems Annals of Mathematics Studies vol. 38 1956 Princeton University Press Princeton, NJ, USA 247 254
10. G.L. Nemhauser, and L.A. Wolsey Integer and Combinatorial Optimization 1988 Wiley-Interscience New York, NY, USA
11. Y. Pochet, and L.A. Wolsey Polyhedra for lot-sizing with Wagner-Whitin costs Math. Program. 67 1 1994 297 323
12. A. Schrijver Theory of Linear and Integer Programming 1986 John Wiley & Sons, Inc. New York, NY, USA
13. M. Van Vyve The continuous mixing polyhedron Math. Oper. Res. 30 2 2005 441 452
14. M. Van Vyve Linear programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity Math. Program. 108 1 2006 53 78