An Algorithm for Multiobjective Zero-One Linear Programming
提出一种基于隐枚举扩展的分支定界算法，用于求解多目标0-1线性规划问题，并开发了支配性测试以剪枝，计算效率较高。
A branch and bound algorithm is presented which is based on the extension of implicit enumeration techniques to multiobjective zero-one linear programming and which appears to be computationally quite efficient. Domination tests, aiming at identifying paths of the enumeration tree that lead to dominated solutions as high up the tree as possible, are developed. Some computational results are also given.