Design of Survivable Networks Using Three- and Four-Partition Facets
From MaRDI portal
Publication:5301121
DOI10.1287/opre.1120.1147zbMath1267.90021OpenAlexW2022496333MaRDI QIDQ5301121
Publication date: 2 July 2013
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1120.1147
integer programmingnetwork designsurvivabilitymulticommodity flow\(k\)-partitionpolyhedral structurefacet inequalities
Related Items
Survivable network design with shared-protection routing, Optimal relay node placement in delay constrained wireless sensor network design, Near optimal design of wavelength routed optical networks, Network loading problem: valid inequalities from 5- and higher partitions, New Valid Inequalities for the Optimal Communication Spanning Tree Problem, A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality