Sparsity pattern

umts

Nameumts
Downloadumts.mps.gz
Solutionumts.sol.gz
Set Membership Tree
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorC. Polo
Rows4465
Cols2947
Num. non-zeros in A23016
Num. non-zeros in c2802
Rows/Cols1.5151001018
Integers72
Binaries2802
Continuous73
min nonzero |Aij|1
max |Aij|1e+09
min nonzero |cj|1
max |cj|1400000
Integer Objective30090328
LP Objective29129565.161344
Aggregation
Variable Bound1128
Set partitioning150
Set packing
Set covering1801
Cardinality12
Equality Knapsacks
Bin packing
Invariant Knapsack1801
Knapsacks
Integer Knapsack
Mixed 0/154
General Cons.30
References FischettiLodi2003 Polo2002

Telecommunications network model


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