Name | stp3d |

Download | stp3d.mps.gz |

Solution | stp3d.sol.gz |

Orginator | ZIB |

Formulator | David Grove Joergensen, Thorsten Koch |

Donator | Thorsten Koch |

Rows | 159488 |

Cols | 204880 |

Non-zeros | 662128 |

Integers | |

Binaries | 204880 |

Continuous | |

|Min| | 1.00000000e+00 |

|Max| | 1.00000000e+00 |

Integer Objective | 493.71965 |

LP Objective | 481.877787 |

Root LP Basis | stp3d.bas.gz |

Set partitioning | 82 |

Set packing | 131403 |

Set covering | |

Cardinality | 28003 |

Equality Knapsacks | |

Bin packing | |

Invariant Knapsack | |

Knapsacks | |

Integer Knapsack | |

Upper bounds | |

Lower bounds | |

Mixed 0/1 | |

General Cons. | |

References | Koch2004 Vazacopoulos2006 |

3D Steiner Tree packing problem (VLSI routing problem in a multi-layer grid graph)

Alkis Vazacopoulos reports finding the first feasible solution of this instance using XPRESS 2006B.

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. The problem was presolved several times with SCIP presolving techniques. After that, it took approximately 114 hours to solve this instance.

Last Update $ by Gerald Gamrath

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

Imprint