| Name | wachplan |
| Download | wachplan.mps.gz |
| Solution | wachplan.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | S. Orlowski |
| Rows | 1553 |
| Cols | 3361 |
| Num. non-zeros in A | 89361 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 0.462064861648 |
| Integers | 1 |
| Binaries | 3360 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | -8 |
| LP Objective | -9 |
| Aggregation | |
| Variable Bound | 224 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | 224 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 1064 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 28 |
| General Cons. | 8 |
| References |
Shift planning model to assign crew members to shifts for a sail training trip