| Name | umts |
| Download | umts.mps.gz |
| Solution | umts.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | C. Polo |
| Rows | 4465 |
| Cols | 2947 |
| Num. non-zeros in A | 23016 |
| Num. non-zeros in c | 2802 |
| Rows/Cols | 1.5151001018 |
| Integers | 72 |
| Binaries | 2802 |
| Continuous | 73 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1e+09 |
| min nonzero |cj| | 1 |
| max |cj| | 1400000 |
| Integer Objective | 30090328 |
| LP Objective | 29129565.161344 |
| Aggregation | |
| Variable Bound | 1128 |
| Set partitioning | 150 |
| Set packing | |
| Set covering | 1801 |
| Cardinality | 12 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 1801 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 54 |
| General Cons. | 30 |
| References |