Geometrical con ... guration of the Pareto frontier of bi-criteria { 0 , 1 }-knapsack problems
暂无分享,去创建一个
This paper deals with three particular models of the bi-criteria {0,1}-knapsack problem: equal weighted items, constant sum of the criteria coe¢cients, and the combination of the two previous models. The con...guration of the Pareto frontier is presented and studied. Several properties on the number and the composition of the e¢cient solutions are devised. The connectedness of the e¢cient solutions is investigated and observed for the entire set of e¢cient solutions of the third model. The models are highly structured and induce singular properties in the geometry of Pareto frontiers when compared with the ones of randomly generated instances. This aspect can increase the knowledge about the generation of e¢cient solutions for general bi-criteria {0,1}-knapsack problems. The models can also be useful in generic {0,1}-multiple criteria problems. Key-words: Bi-criteria knapsack problems, Pareto frontier, Connectedness, Combinatorial Optimization.
[1] Hans Kellerer,et al. Approximation algorithms for knapsack problems with cardinality constraints , 2000, Eur. J. Oper. Res..
[2] S. Helbig,et al. On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces , 1990 .
[3] David Pisinger. A Fast Algorithm for Strongly Correlated Knapsack Problems , 1998, Discret. Appl. Math..
[4] R. S. Laundy,et al. Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .