| Name | in |
| Download | in.mps.gz |
| Solution | in.sol.gz |
| Set Membership | Challenge Reoptimize XXL |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Fügenschuh |
| Rows | 1526202 |
| Cols | 1449074 |
| Num. non-zeros in A | 6811639 |
| Num. non-zeros in c | 1489 |
| Rows/Cols | 1.05322571518 |
| Integers | |
| Binaries | 1489 |
| Continuous | 1447585 |
| min nonzero |Aij| | 1 |
| max |Aij| | 2 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 58 |
| LP Objective | Unknown |
| Aggregation | 43 |
| Variable Bound | 1447585 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 77669 |
| General Cons. | |
| References |
Packing of paths, multicommodity flow formulation. Solved in December 2013 by Gurobi development version.