Finding All Solutions for a Class of Parametric Quadratic Integer Programming Problems
Management Science · 1980 · Volume 26 · Issue 8
Abstract
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.
Keywords
parametric quadratic integer programming
Enable JavaScript for citation tools and additional paper interactions.