An augmented arborescence formulation for the two-level network design problem

DOI10.1023/A:1014553523631zbMATH Open1019.90004MaRDI QIDQ1599298FDOQ1599298

Authors: João Telhada, Luis Gouveia Edit this on Wikidata

Publication date: 9 June 2002

Published in: Annals of Operations Research (Search for Journal in Brave)

Recommendations

• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• The hierarchical network design problem with transshipment facilities
• Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
• A Dual-Based Algorithm for Multi-Level Network Design
• The two layer network design problem

zbMATH Keywords

network designlinear programming relaxationsmulticommodity flow modelsspanning trees and steiner trees

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10)

Cited In (9)

• Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• Branch-and-price algorithm for the resilient multi-level hop-constrained network design
• Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
• A survey on Benders decomposition applied to fixed-charge network design problems
• A branch and cut algorithm for the hierarchical network design problem
• A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
• The multi-weighted Steiner tree problem: A reformulation by intersection
• Optimal design of hierarchical networks with free main path extremes

This page was built for publication: An augmented arborescence formulation for the two-level network design problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599298)