Sparsity pattern

danoint

Namedanoint
Downloaddanoint.mps.gz
Solutiondanoint.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorD. Bienstock
Rows664
Cols521
Num. non-zeros in A3232
Num. non-zeros in c1
Rows/Cols1.27447216891
Integers
Binaries56
Continuous465
min nonzero |Aij|0.5
max |Aij|66.5
min nonzero |cj|1
max |cj|1
Integer Objective65.666666667
LP Objective62.63728
Aggregation
Variable Bound400
Set partitioning
Set packing
Set covering
Cardinality16
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1248
General Cons.
References GunlukBienstock1995

Telecommunications applications


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