| Name | swath |
| Download | swath.mps.gz |
| Solution | swath.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | D. Panton |
| Rows | 884 |
| Cols | 6805 |
| Num. non-zeros in A | 34965 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 0.129904481999 |
| Integers | |
| Binaries | 6724 |
| Continuous | 81 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1116.568 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 467.407491 |
| LP Objective | 334.496858 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | 22 |
| Set packing | |
| Set covering | |
| Cardinality | 80 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 381 |
| General Cons. | |
| References | PantonElbers1999 |
Model arising from the defense industry, involves planning missions for radar surveillance. John Forrest and Laszlo Ladanyi solved this instance by reformulation in 1999. Alkis Vazacopoulos reports solving this instance using XPRESS 2006B.