Sparsity pattern

g200x740i

Nameg200x740i
Downloadg200x740i.mps.gz
Solutiong200x740i.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorF. Ortega, L. Wolsey
Rows940
Cols1480
Num. non-zeros in A2960
Num. non-zeros in c1480
Rows/Cols0.635135135135
Integers
Binaries740
Continuous740
min nonzero |Aij|1
max |Aij|200
min nonzero |cj|1
max |cj|499
Integer Objective30086
LP Objective2292.465
Aggregation
Variable Bound740
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1200
General Cons.
References OrtegaWolsey2003

Fixed cost network flow problems. Solved by CPLEX 12.4 in 104738 seconds (April 2012).


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