| Name | rail02 |
| Download | rail02.mps.gz |
| Solution | rail02.sol.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | T. Schlechte |
| Rows | 95791 |
| Cols | 270869 |
| Num. non-zeros in A | 756228 |
| Num. non-zeros in c | 34359 |
| Rows/Cols | 0.353643274055 |
| Integers | |
| Binaries | 270869 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 60 |
| min nonzero |cj| | 6.666667e-07 |
| max |cj| | 9.994556 |
| Integer Objective | -200.449907667 |
| LP Objective | -206.6102 |
| Aggregation | 39086 |
| Variable Bound | |
| Set partitioning | 31181 |
| Set packing | 2700 |
| Set covering | |
| Cardinality | 22819 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | 3 |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |