Sparsity pattern

in

Namein
Downloadin.mps.gz
Solutionin.sol.gz
Set Membership Challenge Reoptimize XXL
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorA. Fügenschuh
Rows1526202
Cols1449074
Num. non-zeros in A6811639
Num. non-zeros in c1489
Rows/Cols1.05322571518
Integers
Binaries1489
Continuous1447585
min nonzero |Aij|1
max |Aij|2
min nonzero |cj|1
max |cj|1
Integer Objective58
LP ObjectiveUnknown
Aggregation43
Variable Bound1447585
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/177669
General Cons.
References

Packing of paths, multicommodity flow formulation. Solved in December 2013 by Gurobi development version.


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