Sparsity pattern

ns1631475

Namens1631475
Downloadns1631475.mps.gz
Set Membership Challenge Reoptimize
Problem StatusOpen
Problem FeasibilityFeasible
Originator/ContributorH. Mittelmann, Neos Server
Rows24496
Cols22696
Num. non-zeros in A116733
Num. non-zeros in c1
Rows/Cols1.07930912936
Integers211
Binaries22470
Continuous15
min nonzero |Aij|1
max |Aij|4790.942
min nonzero |cj|1
max |cj|1
Integer ObjectiveUnknown
LP Objective817.193748
Aggregation
Variable Bound22288
Set partitioning30
Set packing
Set covering
Cardinality1785
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1183
General Cons.210
References neos

Traveling salesman problem model


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