An augmented arborescence formulation for the two-level network design problem
From MaRDI portal
Publication:1599298
DOI10.1023/A:1014553523631zbMath1019.90004MaRDI QIDQ1599298
Publication date: 9 June 2002
Published in: Annals of Operations Research (Search for Journal in Brave)
network designmulticommodity flow modelslinear programming relaxationsspanning trees and steiner trees
Related Items (6)
Branch-and-price algorithm for the resilient multi-level hop-constrained network design ⋮ A branch and cut algorithm for the hierarchical network design problem ⋮ Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations ⋮ Optimal design of hierarchical networks with free main path extremes ⋮ The multi-weighted Steiner tree problem: A reformulation by intersection ⋮ A survey on Benders decomposition applied to fixed-charge network design problems
This page was built for publication: An augmented arborescence formulation for the two-level network design problem
