Extending the QCR method to general mixed-integer programs
Authors:
- 22 May 2010
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 131 (1-2) , 381-401
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Constrained 0–1 quadratic programming: Basic approaches and extensionsEuropean Journal of Operational Research, 2008
- An algorithmic framework for convex mixed integer nonlinear programsDiscrete Optimization, 2008
- Partial Lagrangian relaxation for general quadratic programming4OR, 2006
- Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 ProblemMathematical Programming, 2006
- Dynamic programming algorithms for the optimal cutting of equal rectanglesApplied Mathematical Modelling, 2005
- Perspective cuts for a class of convex 0–1 mixed integer programsMathematical Programming, 2005
- Global optimization of mixed-integer nonlinear programs: A theoretical and computational studyMathematical Programming, 2004
- Aggregate line capacity design for PWB assembly systemsInternational Journal of Production Research, 2000
- CSDP, A C library for semidefinite programmingOptimization Methods and Software, 1999
- A new bound for the quadratic knapsack problem and its use in a branch and bound algorithmOptimization, 1986