Sparsity pattern

r80x800

Namer80x800
Downloadr80x800.mps.gz
Solutionr80x800.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorF. Ortega, L. Wolsey
Rows880
Cols1600
Num. non-zeros in A3200
Num. non-zeros in c1600
Rows/Cols0.55
Integers
Binaries800
Continuous800
min nonzero |Aij|1
max |Aij|1000
min nonzero |cj|1
max |cj|39
Integer Objective5332
LP Objective3651.48
Aggregation
Variable Bound800
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/180
General Cons.
References OrtegaWolsey2003

Fixed cost network flow problems. Solved by Gurobi 4.6.1 (12 threads) in about 79 hours (March 2012).


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