Name | germany50-DBM |

Download | germany50-DBM.mps.gz |

Solution | germany50-DBM.sol.gz |

Set Membership | Challenge |

Problem Status | Hard |

Problem Feasibility | Feasible |

Originator/Contributor | C. Raack |

Rows | 2526 |

Cols | 8189 |

Num. non-zeros in A | 24479 |

Num. non-zeros in c | 88 |

Rows/Cols | 0.308462571743 |

Integers | 88 |

Binaries | |

Continuous | 8101 |

min nonzero |Aij| | 1 |

max |Aij| | 40 |

min nonzero |cj| | 3290 |

max |cj| | 4150 |

Integer Objective | 473840 |

LP Objective | 438028 |

Aggregation | 9 |

Variable Bound | |

Set partitioning | |

Set packing | |

Set covering | |

Cardinality | |

Equality Knapsacks | |

Bin packing | |

Invariant Knapsack | |

Knapsacks | |

Integer Knapsack | |

Mixed 0/1 | 2341 |

General Cons. | 176 |

References | AchterbergRaack2010 RaackKosterOrlowskiWessaely2011 OrlowskiPioroTomaszewskiWessaely2010 sndlib |

Network design, link dimensioning model for problem in the SNDlib. This problem was solved on ISM supercomputer Fujitsu PRIMERGY RX200S5 (http://www.ism.ac.jp/computer_system/eng/sc/index.html) by ParaSCIP in approximately 590 hours with 14 times restarted 15 jobs.

Last Update July 12, 2018 by Gerald Gamrath

© 2018 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)

Imprint