A note on Benders' decomposition in mixed-integer quadratic programming
From MaRDI portal
Publication:908853
DOI10.1016/0167-6377(90)90045-7zbMath0693.90072OpenAlexW2067801736MaRDI QIDQ908853
Olaf E. Flippo, Alexander H. G. Rinnooy Kan
Publication date: 1990
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(90)90045-7
Related Items (2)
Decomposition in general mathematical programming ⋮ Dorn's duality for quadratic programs revisited: The nonconvex case
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- Duality in quadratic programming
- Improved algorithm for mixed-integer quadratic programs and a computational study
- Mixed-integer quadratic programming
- Symmetric dual quadratic programs
- Duality in Discrete Programming: II. The Quadratic Case
This page was built for publication: A note on Benders' decomposition in mixed-integer quadratic programming