A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
提出一种新的标准空间搜索算法（平衡盒方法），用于找出双目标整数规划的所有非支配点，该方法易于实现、收敛快，并能快速逼近有效前沿。
We present a new criterion space search algorithm, the balanced box method, for finding all nondominated points of a biobjective integer program. The method extends the box algorithm, is easy to implement, and converges quickly to the complete set of nondominated points. Because the method maintains, at any point in time, a diverse set of nondominated points, it is ideally suited for fast approximation of the efficient frontier. In addition, we present several enhancements of the well-known ε-constraint, augmented weighted Tchebycheff, and perpendicular search methods. An extensive computational study, using instances from different classes of combinatorial optimization problems, demonstrates the efficacy of the balanced box method.