Sparsity pattern

p100x588b

Namep100x588b
Downloadp100x588b.mps.gz
Solutionp100x588b.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorF. Ortega, L. Wolsey
Rows688
Cols1176
Num. non-zeros in A2352
Num. non-zeros in c1125
Rows/Cols0.585034013605
Integers
Binaries588
Continuous588
min nonzero |Aij|1
max |Aij|900
min nonzero |cj|1
max |cj|1000
Integer Objective47878
LP Objective5554.011111
Aggregation
Variable Bound588
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1100
General Cons.
References OrtegaWolsey2003

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


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