| Name | rail01 |
| Download | rail01.mps.gz |
| Solution | rail01.sol.gz |
| Set Membership | Reoptimize |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | T. Schlechte |
| Rows | 46843 |
| Cols | 117527 |
| Num. non-zeros in A | 392086 |
| Num. non-zeros in c | 15760 |
| Rows/Cols | 0.398572242974 |
| Integers | |
| Binaries | 117527 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 226 |
| min nonzero |cj| | 1e-07 |
| max |cj| | 9.99835 |
| Integer Objective | -70.5699643 |
| LP Objective | -92.0873 |
| Aggregation | 20791 |
| Variable Bound | 1 |
| Set partitioning | 14412 |
| Set packing | 1321 |
| Set covering | |
| Cardinality | 10305 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | 12 |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |