Remarks on a difficult test problem for quadratic boolean programming
- 1 January 1992
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 26 (3-4) , 355-357
- https://doi.org/10.1080/02331939208843863
Abstract
We show that a “difficult” example is only difficult for special kinds of algorithmsKeywords
This publication has 4 references indexed in Scilit:
- Computational aspects of a branch and bound algorithm for quadratic zero-one programmingComputing, 1990
- An exact penalty approach for solving a class of minimization problems with boolean variablesOptimization, 1988
- A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm1Optimization, 1988
- Zur effektiven Lösung von booleschen, quadratischen OptimierungsproblemenNumerische Mathematik, 1982