Sparsity pattern

ns2137859

Namens2137859
Downloadns2137859.mps.gz
Set Membership Challenge
Problem StatusOpen
Problem FeasibilityFeasible
Originator/ContributorH. Mittelmann, Neos Server
Rows206726
Cols103361
Num. non-zeros in A923682
Num. non-zeros in c102961
Rows/Cols2.00003869932
Integers
Binaries103041
Continuous320
min nonzero |Aij|1
max |Aij|2048
min nonzero |cj|5
max |cj|2024
Integer ObjectiveUnknown
LP Objective24629
Aggregation
Variable Bound240
Set partitioning640
Set packing
Set covering2
Cardinality321
Equality Knapsacks
Bin packing
Invariant Knapsack2
Knapsacks1
Integer Knapsack
Mixed 0/1102080
General Cons.
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