论文信息 - Solving Multi-Objective Knapsack Problem by a Branch-and-Bound Procedure - 字舞流文

Solving Multi-Objective Knapsack Problem by a Branch-and-Bound Procedure

A classical knapsack problem with two objectives is considered in which concepts of supported and non supported efficient solutions are pointed out.

J. Teghem | Ulungu-Ekunda Lukata

[1] G. Kiziltan,et al. An Algorithm for Multiobjective Zero-One Linear Programming , 1983 .

[2] Meir J. Rosenblatt,et al. Generating the Discrete Efficient Frontier to the Capital Budgeting Problem , 1989, Oper. Res..

[3] H. Pastijn,et al. Constructing an outranking relation with ORESTE , 1989 .

[4] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[5] E. L. Ulungu,et al. Multi‐objective combinatorial optimization problems: A survey , 1994 .