G-2000-59
A Simple Enumerative Algorithm for Unconstrained 0-1 Quadratic Programming
, , and BibTeX reference
We modify the algorithm of Pardalos and Rodgers [40] for the minimization of a pseudo-boolean quadratic function by introducing an easy to compute lower bound as well as a variable fixation test, based on the concept of roof-duality. Numerical results show that the new algorithm outperforms the original algorithm of Pardalos and Rodgers.
Published November 2000 , 24 pages
Research Axis
Research applications
Document
G0059.ps (600 KB)