Unconstrained 0–1 optimization and Lagrangean relaxation
- 31 December 1990
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 29 (2-3) , 131-142
- https://doi.org/10.1016/0166-218x(90)90139-4
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the equivalence of paved-duality and standard linearization in nonlinear 0–1 optimizationDiscrete Applied Mathematics, 1990
- Roof duality for polynomial 0–1 optimizationMathematical Programming, 1987
- Roof duality, complementation and persistency in quadratic 0–1 optimizationMathematical Programming, 1984
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear ProgramOperations Research, 1974
- A Selection Problem of Shared Fixed Costs and Network FlowsManagement Science, 1970