An Implicit Enumeration Algorithm for Quadratic Integer Programming

Management Science · 1980 · Volume 26 · Issue 3

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

quadratic integer programming

Enable JavaScript for citation tools and additional paper interactions.