Strong lower bounds for a survivable network design problem
type: Item
instance of: scholarly article
zbMATH Open document ID: 1237.90173
author: Markus Leitner
author: Günther R. Raidl
published in: Electronic Notes in Discrete Mathematics
publication date: 2012-05-13T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6033937
zbMATH Keywords: mixed integer programming
zbMATH Keywords: column generation
zbMATH Keywords: survivable network design
MaRDI profile type: Publication
full work available at URL: j.endm.2010.05.038
OpenAlex ID: W1986165143
Wikidata QID: Q57705373
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
cites work: The directed subgraph homeomorphism problem
cites work: Design of Survivable Networks: A survey
cites work: A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks
DOI: 10.1016/J.ENDM.2010.05.038
title: Strong lower bounds for a survivable network design problem
description: scientific article; zbMATH DE number 6033937