We describe a practical procedure for finding all solutions to a parametric family of nonseparable quadratic integer programs that differ in their resource availabilities. We outline a new method for optimizing these quadratic integer programs, and demonstrate how to solve a sequence of such problems parametrized against the right-hand-side of a single constraint. Several methods for accelerating the basic procedure are presented, and computational experience is provided.
No takes yet. Share an insight, caveat, or question.
McBride et al. (1980) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: