Sparsity pattern

swath

Nameswath
Downloadswath.mps.gz
OrginatorDavid Panton
FormulatorDavid Panton
DonatorDavid Panton
Rows884
Cols6805
Non-zeros34965
Integers
Binaries6724
Continuous
|Min|1.00000000e+00
|Max|1.11656780e+03
Integer Objective467.407491
LP Objective3.34496858e+02
Root LP Basisswath.bas.gz
Set partitioning423
Set packing
Set covering
Cardinality80
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Upper bounds
Lower bounds
Mixed 0/1381
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.


Last Update : 2010/06/09 13:56:11 $ by Gerald Gamrath
© 2010 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint