Sparsity pattern

co-100

Nameco-100
Downloadco-100.mps.gz
Solutionco-100.sol.gz
Set Membership Challenge
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorA. Werner
Rows2187
Cols48417
Num. non-zeros in A1995817
Num. non-zeros in c47217
Rows/Cols0.0451700848875
Integers
Binaries48417
Continuous
min nonzero |Aij|1
max |Aij|20000
min nonzero |cj|40
max |cj|8373000
Integer Objective2639942.06
LP Objective917102.214427
Aggregation
Variable Bound11
Set partitioning173
Set packing2
Set covering
Cardinality
Equality Knapsacks
Bin packing1989
Invariant Knapsack1
Knapsacks11
Integer Knapsack
Mixed 0/1
General Cons.
References BentzMartensOrlowskiWernerWessaely2010

Model from optical access network planning


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