Sparsity pattern

blp-ic97

Nameblp-ic97
Downloadblp-ic97.mps.gz
Solutionblp-ic97.sol.gz
Set Membership Challenge
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorM. Lübbecke
Rows923
Cols9845
Num. non-zeros in A118149
Num. non-zeros in c1
Rows/Cols0.0937531742001
Integers
Binaries9753
Continuous92
min nonzero |Aij|1
max |Aij|957.0086
min nonzero |cj|1
max |cj|1
Integer Objective4.0250235808e+03
LP Objective3846.358667
Aggregation
Variable Bound
Set partitioning
Set packing831
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/192
General Cons.
References BussieckLindnerLuebbecke2004 FischettiGloverLodi2005

Railway line planning instance. Solved using CPLEX 12.3 (12 threads) on an Intel Xeon X5650 @ 2.67GHz, 12MB cache, 24GB RAM in 4947.5 sec. Solved using Gurobi 4.6.1 (12 threads) in 1867.9 sec.


Last Update December 6, 2016 by Gerald Gamrath
© 2016 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint