Finding All Solutions for a Class of Parametric Quadratic Integer Programming Problems

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.

• 저널Management Science · 26(8) · 784–795
• 토픽Optimization and Mathematical Programming · Control and Systems Engineering
• DOI10.1287/mnsc.26.8.784
• 저자Richard D. McBride, Jonathan S. Yormark