| Name | rail03 |
| Download | rail03.mps.gz |
| Solution | rail03.sol.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | T. Schlechte |
| Rows | 253905 |
| Cols | 758775 |
| Num. non-zeros in A | 1728451 |
| Num. non-zeros in c | 78545 |
| Rows/Cols | 0.334624888801 |
| Integers | |
| Binaries | 758775 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 62 |
| min nonzero |cj| | 6.666667e-07 |
| max |cj| | 9.994556 |
| Integer Objective | -867.093965444446 |
| LP Objective | -920.274 |
| Aggregation | 112561 |
| Variable Bound | 44 |
| Set partitioning | 86933 |
| Set packing | 4083 |
| Set covering | |
| Cardinality | 50254 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | 30 |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |