An Implicit Enumeration Algorithm for Quadratic Integer Programming
提出一种用于不可分二次整数规划问题的隐式枚举算法，利用Lemke互补转轴算法推导剪枝准则，并比较伪成本与广义惩罚作为分支引导的效果，附有计算经验。
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.