descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1980 English Publisher:Institute for Operations Research and the Management Sciences (INFORMS)Journal:Management Science, volume 26, pages 282-296 (issn: 0025-1909, eissn: 1526-5501,

Authors: R. D. McBride; J. S. Yormark;

doi: 10.1287/mnsc.26.3.282

An Implicit Enumeration Algorithm for Quadratic Integer Programming

- Summary
- Subjects
- Metrics

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.

Related Organizations

University of California System
United States

Keywords

pseudo-costs, nonlinear extension, quadratic integer programming, implicit enumeration method, Quadratic programming, Lemke's complementary pivot method, parametric penalties, Numerical mathematical programming methods, Boolean programming, implicit upper bounding, guide branching

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	87
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%