Sparsity pattern

ger50_17_trans

Nameger50_17_trans
Downloadger50_17_trans.mps.gz
Solutionger50_17_trans.sol.gz
Set Membership Challenge Unstable
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorC. Raack
Rows499
Cols22414
Num. non-zeros in A172035
Num. non-zeros in c18062
Rows/Cols0.0222628714196
Integers18062
Binaries
Continuous4352
min nonzero |Aij|1
max |Aij|32000
min nonzero |cj|8.5488
max |cj|35.74
Integer Objective7393.2618
LP Objective6850.628623
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1273
General Cons.226
References BleyMenneKlaehneRaackWessaely2008 ShinanoEtAl2018

Multi-layer network design problem using a link-flow formulation over a path-flow formulation.
First solved with the latest version of ParaXpress in March 2018 with one load coordinator and 31 solver processes, each of them running Xpress 8.4.6 with 6 threads, in about 1800 seconds. A MIP start (initial solution) was given, which was generated during ParaXpress development and tested in the first implementation (ShinanoEtAl2018 ).


Last Update July 12, 2018 by Gerald Gamrath
© 2018 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint