[top]
The 0-1 bi-objective knapsack problem
Instances
Here you can find 4 types of numerical instances concerning the 0-1 bi-objective knapsack problem.
- Type A: Random instances,
n = 100, 200, 300, 400, 500, 600, and 700
- Type B: Unconflicting instances,
n = 600, 700, 800, 900, 1000, 2000, 3000, and 4000
- Type C: Conflicting instances,
n = 100, 200, 300, 400, and 500
- Type D: Conflicting instances with correlated weight,
n = 100, 150, 200, and 250
For each type and each value of n, 10 instances have been generated.
For each instance described by a ".dat" the set of non-dominated criterion vectors is given in a file ".eff".
See the reference for more details about the description of the instances.
File Format
In each file, lines begin with a character which describes the type of data. The character can be:
- n : number of items
- c: comments
- i: description of an item begin with its weight, followed by its criterion vector
- W: the capacity of the knapsack
Reference
-
An efficient implementation for the 0-1 multi-objective knapsack problem,
C. Bazgan, H. Hugot, and D. Vanderpooten,
In proceedings of the 6th Workshop on Experimental Algorithms (WEA'07), LNCS 4525, pages 406-419, 2007.