| Name | bley_xl1 |
| Download | bley_xl1.mps.gz |
| Solution | bley_xl1.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Bley |
| Rows | 175620 |
| Cols | 5831 |
| Num. non-zeros in A | 869391 |
| Num. non-zeros in c | 126 |
| Rows/Cols | 30.1183330475 |
| Integers | |
| Binaries | 5831 |
| Continuous | |
| min nonzero |Aij| | 0.5 |
| max |Aij| | 1e+08 |
| min nonzero |cj| | 10 |
| max |cj| | 1000 |
| Integer Objective | 190 |
| LP Objective | 154.3902 |
| Aggregation | 93 |
| Variable Bound | 1410 |
| Set partitioning | 168 |
| Set packing | 3633 |
| Set covering | |
| Cardinality | 2027 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 112628 |
| Knapsacks | 78 |
| Integer Knapsack | |
| Mixed 0/1 | 55486 |
| General Cons. | |
| References |
Min-cost network dimensioning problem with finite sets of link capacities and unsplittable flow routing