Disjunctive programming: Properties of the convex hull of feasible points
- 1 December 1998
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 89 (1-3) , 3-44
- https://doi.org/10.1016/s0166-218x(98)00136-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Improved convexity cuts for lattice point problemsJournal of Optimization Theory and Applications, 1976
- On algorithms for discrete problemsDiscrete Mathematics, 1974
- The Generalized Lattice-Point ProblemOperations Research, 1973
- Cutting planes for programs with disjunctive constraintsJournal of Optimization Theory and Applications, 1973
- Integer programming and convex analysis: Intersection cuts from outer polarsMathematical Programming, 1972