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.