A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks

DOI10.1007/978-3-540-75520-3_60zbMath1151.90567OpenAlexW1556386174MaRDI QIDQ3527257

Petra Mutzel, Markus Chimani, Maria Kandyba

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_60

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (5)

Strong Lower Bounds for a Survivable Network Design Problem ⋮ Exact algorithms for budgeted prize-collecting covering subgraph problems ⋮ Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice ⋮ Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements ⋮ Strong Formulations for 2-Node-Connected Steiner Network Problems

This page was built for publication: A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks