共 50 条
- [2] Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem Journal of Global Optimization, 1998, 12 : 139 - 155
- [3] Cooperation between branch and bound and evolutionary approaches to solve a bi-objective flow shop problem EXPERIMENTAL AND EFFICIENT ALGORITHMS, 2004, 3059 : 72 - 86
- [6] Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem Annals of Operations Research, 2006, 147 : 23 - 41
- [8] An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION (EVOCOP 2013), 2013, 7832 : 85 - 96
- [10] An exact method to solve a Bi-objective Resource Constraint Project Scheduling Problem IFAC PAPERSONLINE, 2016, 49 (12): : 1038 - 1043