Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach
- 11 May 2010
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 146 (2) , 463-489
Abstract
No abstract availableKeywords
This publication has 47 references indexed in Scilit:
- Polynomially Solvable Cases of Binary Quadratic Programs2010
- Lower Bound Improvement and Forcing Rule for Quadratic Binary ProgrammingComputational Optimization and Applications, 2005
- Seizure warning algorithm based on optimization and nonlinear dynamicsMathematical Programming, 2004
- Quadratic Binary Programming and Dynamical System Approach to Determine the Predictability of Epileptic SeizuresJournal of Combinatorial Optimization, 2001
- A unified approach to polynomially solvable cases of integer “non-separable” quadratic optimizationDiscrete Applied Mathematics, 1995
- Quadratic Optimization1995
- A polynomial algorithm for an integer quadratic non-separable transportation problemMathematical Programming, 1992
- Computational aspects of a branch and bound algorithm for quadratic zero-one programmingComputing, 1990
- Integer and Combinatorial Optimization1988
- Matrix Analysis1985