Sparsity pattern

arki001

Namearki001
Downloadarki001.mps.gz
Solutionarki001.sol.gz
OrginatorAvesta-Sheffield, Sweden
FormulatorNils Holmberg
DonatorArne Stolbjerg Drud
Rows1048
Cols1388
Non-zeros20439
Integers123
Binaries415
Continuous
|Min|2.00000000e-04
|Max|2.33066667e+07
Integer Objective7.5808130460e+06
LP Objective7.57959981e+06
Root LP Basisarki001.bas.gz
Set partitioning
Set packing2
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack6
Knapsacks13
Integer Knapsack40
Upper bounds
Lower bounds
Mixed 0/1558
General Cons.429
References Achterberg2004 Vazacopoulos2006

the model originates in the metalurgic industry

The first reported solution is due to Anureet Saxena and Egon Balas, reported in Optimizing over the Split Closure, MSRR-674, December 2005. Solving time was about 64 hours.

Bob Bixby reports solving this instance by letting CPLEX run for nearly a month, computing more than 100,000,000 nodes.

Using SCIP with CPLEX 10.0 as LP-Solver Tobias Achterberg solved arki001 in less than 9 hours on an AMD Opteron 2.2 GHz computing only about 3 million nodes. Again strong branching seems to be the key to success, as the following settings were used:

Alkis Vazacopoulos reports solving this instance using XPRESS 2006A in 4 hours on a 2 processor Xeon system, computing about 1,200,000 nodes.


Last Update : 2010/06/09 13:56:10 $ by Gerald Gamrath
© 2010 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint