An Implicit Enumeration Algorithm for Quadratic Integer Programming
Published in Management Science • Mar 1, 1980
Authors:,
R. D. McBride
J. S. Yormark
Abstract
We present an implicit enumeration algorithm for a nonseparable quadratic integer programming problem. We utilize fathoming criteria derived from Lemke's complementary pivot algorithm, and compare the use of pseudo-costs versus generalized penalties as a guide to branching. Computational experience ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!