Sparsity pattern

swath

Nameswath
Downloadswath.mps.gz
Solutionswath.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorD. Panton
Rows884
Cols6805
Num. non-zeros in A34965
Num. non-zeros in c1
Rows/Cols0.129904481999
Integers
Binaries6724
Continuous81
min nonzero |Aij|1
max |Aij|1116.568
min nonzero |cj|1
max |cj|1
Integer Objective467.407491
LP Objective334.496858
Aggregation
Variable Bound
Set partitioning22
Set packing
Set covering
Cardinality80
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1381
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.


Last Update February 28, 2017 by Gerald Gamrath
© 2017 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint