Sparsity pattern

nu60-pr9

Namenu60-pr9
Downloadnu60-pr9.mps.gz
Solutionnu60-pr9.sol.gz
Set Membership Challenge
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorA. Atamtürk, D. Rajan
Rows2220
Cols7350
Num. non-zeros in A22176
Num. non-zeros in c7350
Rows/Cols0.302040816327
Integers42
Binaries7308
Continuous
min nonzero |Aij|1
max |Aij|60
min nonzero |cj|5
max |cj|450
Integer Objective24940
LP Objective22850
Aggregation174
Variable Bound6
Set partitioning14
Set packing
Set covering
Cardinality1900
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.122
References AtamturkRajan2002 bcol

Multicommodity flow capacitated network design problem. Solved with Gurobi 4.5.1 on a 12-core Linux system in 2370.93 sec.


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