| Name | bab5 |
| Download | bab5.mps.gz |
| Solution | bab5.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | E. Swarat |
| Rows | 4964 |
| Cols | 21600 |
| Num. non-zeros in A | 155520 |
| Num. non-zeros in c | 12328 |
| Rows/Cols | 0.229814814815 |
| Integers | |
| Binaries | 21600 |
| Continuous | |
| min nonzero |Aij| | 0.09 |
| max |Aij| | 8 |
| min nonzero |cj| | 15.2099 |
| max |cj| | 3721.63 |
| Integer Objective | -106411.8401 |
| LP Objective | -124657.641413 |
| Aggregation | 4 |
| Variable Bound | |
| Set partitioning | 457 |
| Set packing | 88 |
| Set covering | |
| Cardinality | 548 |
| Equality Knapsacks | 320 |
| Bin packing | |
| Invariant Knapsack | 3443 |
| Knapsacks | 12 |
| Integer Knapsack | |
| Mixed 0/1 | 74 |
| General Cons. | |
| References |
Vehicle routing with profits and an integrated crew scheduling problem formulated by two coupled multi-commodity flow problems