Sparsity pattern

ns1111636

Namens1111636
Downloadns1111636.mps.gz
Solutionns1111636.sol.gz
Set Membership Challenge Reoptimize
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorH. Mittelmann, Neos Server
Rows13895
Cols360822
Num. non-zeros in A568444
Num. non-zeros in c22
Rows/Cols0.0385092926706
Integers
Binaries13200
Continuous347622
min nonzero |Aij|1
max |Aij|192
min nonzero |cj|4
max |cj|10
Integer Objective162
LP Objective96.25
Aggregation
Variable Bound
Set partitioning
Set packing440
Set covering
Cardinality4400
Equality Knapsacks
Bin packing
Invariant Knapsack11
Knapsacks11
Integer Knapsack
Mixed 0/19033
General Cons.
References neos

Network routing problem. Solved in June 2013 by CPLEX 12.5.1 with 32 threads in about 102 hours.


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