Roof duality for polynomial 0–1 optimization
- 1 October 1987
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 37 (3) , 357-360
- https://doi.org/10.1007/bf02591742
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Nonlinear 0–1 programming: II. Dominance relations and algorithmsMathematical Programming, 1984
- Nonlinear 0–1 programming: I. Linearization techniquesMathematical Programming, 1984
- Roof duality, complementation and persistency in quadratic 0–1 optimizationMathematical Programming, 1984
- A Strongly Convergent Primal Simplex Algorithm for Generalized NetworksMathematics of Operations Research, 1979
- A Selection Problem of Shared Fixed Costs and Network FlowsManagement Science, 1970
- Generalized upper bounding techniquesJournal of Computer and System Sciences, 1967