Sparsity pattern

janos-us-DDM

Namejanos-us-DDM
Downloadjanos-us-DDM.mps.gz
Solutionjanos-us-DDM.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorC. Raack
Rows760
Cols2184
Num. non-zeros in A6384
Num. non-zeros in c84
Rows/Cols0.347985347985
Integers84
Binaries
Continuous2100
min nonzero |Aij|1
max |Aij|64
min nonzero |cj|117
max |cj|879
Integer Objective1492707
LP Objective1488134.75
Aggregation5
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1671
General Cons.84
References AchterbergRaack2010 RaackKosterOrlowskiWessaely2011 OrlowskiPioroTomaszewskiWessaely2010 sndlib

Network design, link dimensioning model for problem in the SNDlib. The problem can be solved using the Automatic Benders Decomposition in AIMMS (for details, see the Language Reference of AIMMS 3.14 FR1) using CPLEX or Gurobi within a few minutes. AIMMS uses a two-phase Benders algorithm in which first the relaxed problem is solved using the classic Benders algorithm; afterwards the MIP problem, extended by the Benders cuts generated in the first phase, is solved using a modern approach of the Benders algorithm in which a single master MIP problem is solved.


Last Update December 6, 2016 by Gerald Gamrath
© 2016 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint