Martin Luipersbeck

A Benders decomposition based framework for solving cable trench problems

  • Hatice Calik
  • Markus Leitner
  • Martin Luipersbeck
    • Categories Integer Programming, Network Optimization Tags , , ,

    In this work, we present an algorithmic framework based on Benders decomposition for the Capacitated p-Cable Trench Problem with Covering. We show that our approach can be applied to most variants of the Cable Trench Problem (CTP) that have been considered in the literature. The proposed algorithm is augmented with a stabilization procedure to accelerate … Read more

    A dual-ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems

  • Markus Leitner
  • Ivana Ljubić
  • Martin Luipersbeck
  • Markus Sinnl
    • Categories Combinatorial Optimization, Integer Programming, Network Optimization Tags , , , ,

    In this work we present a branch-and-bound (B&B) framework for the asymmetric prize-collecting Steiner tree problem (APCSTP). Several well-known network design problems can be transformed to the APCSTP, including the Steiner tree problem (STP), prize-collecting Steiner tree problem (PCSTP), maximum-weight connected subgraph problem (MWCS) and the node-weighted Steiner tree problem (NWSTP). The main component of … Read more