Sparsity pattern

n3-3

Namen3-3
Downloadn3-3.mps.gz
Solutionn3-3.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorA. Atamtürk
Rows2425
Cols9028
Num. non-zeros in A35380
Num. non-zeros in c8906
Rows/Cols0.268608772707
Integers366
Binaries
Continuous8662
min nonzero |Aij|1
max |Aij|255
min nonzero |cj|1
max |cj|300
Integer Objective15915
LP Objective7465.294118
Aggregation213
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/11968
General Cons.244
References Atamturk2002 bcol

Capacitated network design problem. Solved in January 2014 with CPLEX 12.6, 32 threads, and 256GB RAM in two consecutive runs. The second run took about 24 days.


Last Update February 28, 2017 by Gerald Gamrath
© 2017 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint