Name | ds |

Download | ds.mps.gz |

Solution | ds.sol.gz |

Orginator | Andreas Loebel |

Formulator | Andreas Loebel |

Donator | Andreas Loebel |

Rows | 656 |

Cols | 67732 |

Non-zeros | 1024059 |

Integers | |

Binaries | 67732 |

Continuous | |

|Min| | 1.00000000e+00 |

|Max| | 1.00000000e+00 |

Integer Objective | 93.5200 |

LP Objective | 5.72345653e+01 |

Root LP Basis | ds.bas.gz |

Set partitioning | 656 |

Set packing | |

Set covering | |

Cardinality | |

Equality Knapsacks | |

Bin packing | |

Invariant Knapsack | |

Knapsacks | |

Integer Knapsack | |

Upper bounds | |

Lower bounds | |

Mixed 0/1 | |

General Cons. | |

References | BorndoerferGroetschelLoebel2003 |

Set partitioning problem orginating from public transport service planning.

This instance was solved by a first implementation of ParaSCIP using up to 2048 cores of HLRN-II(http://www.hlrn.de). ParaSCIP, mainly developed by Yuji Shinano, is an extension of SCIP and realizes a parallelization on a distributed memory computing environment. For being able to interrupt and warmstart the computations, ParaSCIP has a checkpoint mechanism. Therefore, selected subproblems are stored as warm start information, which allows to virtually run ParaSCIP, although the HLRN-II environment imposes a time limit of 48 hours per run. It took approximately 86 hours to solve this instance.

Last Update $ by Gerald Gamrath

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

Imprint