Sparsity pattern

stockholm

Namestockholm
Downloadstockholm.mps.gz
Set Membership Challenge
Problem StatusOpen
Problem FeasibilityFeasible
Originator/ContributorL. Bai, P. Rubin
Rows57346
Cols20644
Num. non-zeros in A171076
Num. non-zeros in c962
Rows/Cols2.77785312924
Integers
Binaries962
Continuous19682
min nonzero |Aij|1
max |Aij|1000
min nonzero |cj|1
max |cj|1
Integer ObjectiveUnknown
LP Objective0.755613
Aggregation
Variable Bound962
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/156384
General Cons.
References BaiRubin2009 BaiStampsHarwoodKollmann2006

Toll booth placement problem


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