Decomposition and Linearization for 0-1 Quadratic Programming
Authors:
- 1 December 2000
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 99 (1-4) , 79-93
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A new upper bound for the 0-1 quadratic knapsack problemEuropean Journal of Operational Research, 1999
- Linear programming for the 0–1 quadratic knapsack problemEuropean Journal of Operational Research, 1996
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear ProgrammingOperations Research, 1995
- A recipe for semidefinite relaxation for (0,1)-quadratic programmingJournal of Global Optimization, 1995
- A Decomposition Method for Quadratic Zero-One ProgrammingManagement Science, 1995
- A hierarchy of relaxations and convex hull characterizations for mixed-integer zero—one programming problemsDiscrete Applied Mathematics, 1994
- Lagrangean decomposition for integer nonlinear programming with linear constraintsMathematical Programming, 1991
- Nonlinear 0–1 programming: II. Dominance relations and algorithmsMathematical Programming, 1984
- Nonlinear 0–1 programming: I. Linearization techniquesMathematical Programming, 1984
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear ProgramOperations Research, 1974