| Name | bab3 |
| Download | bab3.mps.gz |
| Set Membership | Challenge |
| Problem Status | Open |
| Problem Feasibility | Feasible |
| Originator/Contributor | E. Swarat |
| Rows | 23069 |
| Cols | 393800 |
| Num. non-zeros in A | 3301838 |
| Num. non-zeros in c | 126 |
| Rows/Cols | 0.0585804977146 |
| Integers | |
| Binaries | 393800 |
| Continuous | |
| min nonzero |Aij| | 0.5 |
| max |Aij| | 1.0e+08 |
| min nonzero |cj| | 10 |
| max |cj| | 1000 |
| Integer Objective | Unknown |
| LP Objective | -733091.180443 |
| Aggregation | 52 |
| Variable Bound | |
| Set partitioning | 1289 |
| Set packing | 308 |
| Set covering | |
| Cardinality | 2096 |
| Equality Knapsacks | 1072 |
| Bin packing | |
| Invariant Knapsack | 17848 |
| Knapsacks | 36 |
| Integer Knapsack | |
| Mixed 0/1 | 128 |
| General Cons. | |
| References |
Vehicle routing with profits and an integrated crew scheduling problem formulated by two coupled multi-commodity flow problems