Cutting planes for programs with disjunctive constraints
- 1 January 1973
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 11 (1) , 49-55
- https://doi.org/10.1007/bf00934290
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Hypercylindrically Deduced Cuts in Zero-One Integer ProgramsOperations Research, 1971
- Intersection Cuts—A New Type of Cutting Planes for Integer ProgrammingOperations Research, 1971
- The Generalized Lattice Point ProblemPublished by Defense Technical Information Center (DTIC) ,1970