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.
No takes yet. Share an insight, caveat, or question.
McBride et al. (1980) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: