An Implicit Enumeration Algorithm for Quadratic Integer Programming

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.

MoreLess

Year of publication:	1980
Authors:	McBride, R. D. ; Yormark, J. S.
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 26.1980, 3, p. 282-296
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS
Subject:	quadratic integer programming

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.26.3.282 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10009208473