file format.txt

来自「这是典型的背包问题的测试集」· 文本 代码 · 共 31 行

 FILE FORMAT
 The test data's file format, using 10 columns, whenever possible, is
 as follows:
 
 <n := #knapsacks> <m := #objects>
 <m weights of objects>
 <n knapsack capacities>
 <A := mxn matrix of constraints>
 
 <known optimum>
 
 +++++++++++++++++++++++++++++
 
 EXAMPLE
 This is the WEING1.DAT data file plus some comments, that are NOT
 part of the problem instance!
 
 2 28 // 2 knapsacks, 28 objects
 1898 440 22507 270 14148 3100 4650 30800 615 4975
 1160 4225 510 11880 479 440 490 330 110 560
 24355 2885 11748 4550 750 3720 1950 10500 // 28 weights
 600 600 // 2 knapsack capacities
 45 0 85 150 65 95 30 0 170 0
 40 25 20 0 0 25 0 0 25 0
 165 0 85 0 0 0 0 100 // #1 constr.
 30 20 125 5 80 25 35 73 12 15
 15 40 5 10 10 12 10 9 0 20
 60 40 50 36 49 40 19 150 // #2 constr.
 
 141278 // optimum value