| Name | swath |
| Download | swath.mps.gz |
| Orginator | David Panton |
| Formulator | David Panton |
| Donator | David Panton |
| Rows | 884 |
| Cols | 6805 |
| Non-zeros | 34965 |
| Integers | |
| Binaries | 6724 |
| Continuous | |
| |Min| | 1.00000000e+00 |
| |Max| | 1.11656780e+03 |
| Integer Objective | 467.407491 |
| LP Objective | 3.34496858e+02 |
| Root LP Basis | swath.bas.gz |
| Set partitioning | 423 |
| Set packing | |
| Set covering | |
| Cardinality | 80 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Upper bounds | |
| Lower bounds | |
| Mixed 0/1 | 381 |
| General Cons. | |
| References | PantonElbers1999 ForrestLadanyi1999 Vazacopoulos2006 BussieckFerrisMeeraus2007 |
Problem arsing from Mission Planning for Synthetic Aperture Radar Surveillance. Generated with GAMS.
John Forrest and Laszlo Ladanyi solved this instance by reformulation in 1999.
Alkis Vazacopoulos reports solving this instance using XPRESS 2006B.