| Name | shipsched |
| Download | shipsched.mps.gz |
| Set Membership | Challenge |
| Problem Status | Open |
| Problem Feasibility | Feasible |
| Originator/Contributor | E. Günther, M. Lübbecke |
| Rows | 45554 |
| Cols | 13594 |
| Num. non-zeros in A | 121571 |
| Num. non-zeros in c | 1044 |
| Rows/Cols | 3.3510372223 |
| Integers | |
| Binaries | 10549 |
| Continuous | 3045 |
| min nonzero |Aij| | 1 |
| max |Aij| | 73464 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | Unknown |
| LP Objective | 0 |
| Aggregation | 1044 |
| Variable Bound | 2206 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 35992 |
| General Cons. | |
| References |
A ship scheduling problem on the Kiel Canal