An Implicit Enumeration Algorithm for Quadratic Integer Programming

1 March 1980

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science

Vol. 26 (3) , 282-296
https://doi.org/10.1287/mnsc.26.3.282

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 is provided.

Keywords

COMPUTER EXPERIMENT