Strong Lower Bounds for a Survivable Network Design Problem

DOI10.1016/j.endm.2010.05.038zbMath1237.90173OpenAlexW1986165143WikidataQ57705373 ScholiaQ57705373MaRDI QIDQ2883576

Markus Leitner, Günther R. Raidl

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.038

zbMATH Keywords

column generationmixed integer programmingsurvivable network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (1)

Stabilizing branch‐and‐price for constrained tree problems

Cites Work

• The directed subgraph homeomorphism problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
• Design of Survivable Networks: A survey
• A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks

This page was built for publication: Strong Lower Bounds for a Survivable Network Design Problem