Name | berlin_5_8_0 |

Download | berlin_5_8_0.mps.gz |

Solution | berlin_5_8_0.sol.gz |

Set Membership | Challenge |

Problem Status | Easy |

Problem Feasibility | Feasible |

Originator/Contributor | G. Klau |

Rows | 1532 |

Cols | 1083 |

Num. non-zeros in A | 4507 |

Num. non-zeros in c | 49 |

Rows/Cols | 1.41458910434 |

Integers | |

Binaries | 794 |

Continuous | 289 |

min nonzero |Aij| | 1 |

max |Aij| | 242 |

min nonzero |cj| | 1 |

max |cj| | 1 |

Integer Objective | 62 |

LP Objective | 52 |

Aggregation | |

Variable Bound | 476 |

Set partitioning | |

Set packing | |

Set covering | 309 |

Cardinality | |

Equality Knapsacks | |

Bin packing | |

Invariant Knapsack | 309 |

Knapsacks | |

Integer Knapsack | |

Mixed 0/1 | 746 |

General Cons. | |

References | FischettiGloverLodi2005 |

Railway optimization problems. The problem was solved using CPLEX 12.3 on a 32 core Sun Galaxy 4600 machine, equipped with eight Quad-Core AMD Opteron 8384 processors at 2.7 GHz and 512 GB RAM. It took approximately 9 hours. The problem was solved using CPLEX 12.4 in about 55 minutes (May 2014).

Last Update December 6, 2016 by Gerald Gamrath

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

Imprint