Sparsity pattern

bley_xl1

Namebley_xl1
Downloadbley_xl1.mps.gz
Solutionbley_xl1.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorA. Bley
Rows175620
Cols5831
Num. non-zeros in A869391
Num. non-zeros in c126
Rows/Cols30.1183330475
Integers
Binaries5831
Continuous
min nonzero |Aij|0.5
max |Aij|1e+08
min nonzero |cj|10
max |cj|1000
Integer Objective190
LP Objective154.3902
Aggregation93
Variable Bound1410
Set partitioning168
Set packing3633
Set covering
Cardinality2027
Equality Knapsacks
Bin packing
Invariant Knapsack112628
Knapsacks78
Integer Knapsack
Mixed 0/155486
General Cons.
References

Min-cost network dimensioning problem with finite sets of link capacities and unsplittable flow routing


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