Ideal representations of lexicographic orderings and base-2 expansions of integer variables

Operations Research Letters

Volumn 41, Issue 1, 2013, Pages 32-39

  Muldoon, Frank M ^a   Adams, Warren P ^a   Sherali, Hanif D ^b  

^a CLEMSON UNIVERSITY   (United States)

^b Virginia Polytechnic Institute and State University   (United States)

Author keywords

Binary expansion; Convex hull; Integer program; Minimal cover

Indexed keywords

BINARY EXPANSIONS; BINARY VECTORS; CONVEX HULL; INTEGER PROGRAM; INTEGER VARIABLES; LEXICOGRAPHIC ORDERING; MINIMAL COVER; POLYTOPES; SET COVERINGS;

COMPUTATIONAL GEOMETRY; EXPANSION;

INTEGER PROGRAMMING;

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

References (22)

1. W.P. Adams, S.M. Henry, Base-2 expansions for linearizing products of functions of discrete variables, Operations Research (2011). Manuscript (in press).
2. W.P. Adams, and H.D. Sherali A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems Annals of Operations Research 140 1 2005 21 47 (Pubitemid 41705529)
3. Angulo G. Ahmed S. Dey S.S. Forbidding extreme points from the 0-1 hypercube Optimization Online 2012 http://www.optimization-online.org/DB-HTML/ 2012/05/3463.html
4. L. Coppersmith, and J. Lee Parsimonious binary-encoding in integer programming Discrete Optimization 2 3 2005 190 200 (Pubitemid 41500038)
5. F. D'Andreagiovanni, Pure 0-1 programming approaches to wireless network design, Ph.D. Dissertation, University of Rome, 2010.
6. G.B. Dantzig On the significance of solving linear programming problems with some integer variables Econometrica 28 1 1960 30 44
7. R.S. Garfinkel, and G.L. Nemhauser Integer Programming 1972 Wiley New York, NY
8. R. Gillmann, and V. Kaibel Revlex-initial 0/1-polytopes Journal of Combinatorial Theory. Series A 113 5 2006 799 821 (Pubitemid 43758085)
9. M. Laurent, and A. Sassano A characterization of knapsacks with the max-flow-min-cut property Operations Research Letters 11 2 1992 105 110
10. J. Lee All-different polytopes Journal of Combinatorial Optimization 6 3 2002 335 352 (Pubitemid 34474872)
11. J. Lee, and F. Margot More on a binary-encoded coloring formulation Lecture Notes in Computer Science 3064 2004 271 282
12. J. Lee, and F. Margot On a binary-encoded ILP coloring formulation INFORMS Journal on Computing 19 3 2007 406 415
13. C. McMillan Jr. Mathematical Programming: An Introduction to the Design and Application of Optimal Decision Machines 1970 Wiley New York, NY
14. A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone Handbook of Applied Cryptography 1997 CRC Press Boca Raton, FL
15. K.G. Murty Linear and Combinatorial Programming 1976 Wiley New York, NY
16. G.L. Nemhauser, and L.A. Wolsey Integer and Combinatorial Optimization 1999 John Wiley & Sons New York, NY
17. J.H. Owen, and S. Mehrotra On the value of binary expansions for general mixed-integer linear programs Operations Research 50 5 2002 810 819 (Pubitemid 35350669)
18. C.H. Papadimitriou, and K. Steiglitz Combinatorial Optimization: Algorithms and Complexity 1982 Prentice-Hall Englewood Cliffs, NJ
19. P.D. Seymour The matroids with the max-flow-min-cut property Journal of Combinatorial Theory. Series B 23 1977 189 222
20. H. Taha Integer Programming: Theory, Applications, and Computations 1975 Academic Press New York, NY
21. A.F. Veinnott Jr., and H.M. Wagner Optimal capacity scheduling - I Operations Research 10 4 1962 518 532
22. S. Zionts Linear and Integer Programming 1974 Prentice-Hall Englewood Cliffs, NJ