共 50 条
- [43] Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem Annals of Operations Research, 2006, 147 : 23 - 41
- [44] Two-phases method and Branch and Bound procedures to solve the bi-objective knapsack problem J of Global Optim, 2 (139-155):
- [46] Cooperation between branch and bound and evolutionary approaches to solve a bi-objective flow shop problem EXPERIMENTAL AND EFFICIENT ALGORITHMS, 2004, 3059 : 72 - 86
- [48] Solving shortest capacitated path problem using a Bi-objective heuristic approach (invited paper) AMS 2007: FIRST ASIA INTERNATIONAL CONFERENCE ON MODELLING & SIMULATION ASIA MODELLING SYMPOSIUM, PROCEEDINGS, 2007, : 427 - +
- [50] Metaheuristics for the bi-objective ring star problem EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2008, 4972 : 206 - +