Optimal design of hierarchical networks with free main path extremes

DOI10.1016/J.ORL.2007.10.007zbMath1151.90003OpenAlexW1970687438MaRDI QIDQ943800

Miguel Ríos, Carlos Obreque, Vladimir Marianov

Publication date: 10 September 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.10.007

zbMATH Keywords

heuristicsinteger programminghierarchical networks

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (1)

A branch and cut algorithm for the hierarchical network design problem

Uses Software

• SteinLib

Cites Work

• The hierarchical network design problem
• Reducing the hierarchical network design problem
• The hierarchical network design problem with transshipment facilities
• The multi-weighted Steiner tree problem
• Locating concentrators in centralized computer networks
• An addendum to the hierarchical network design problem
• A review of extensive facility location in networks
• The hierarchical network design problem with multiple primary paths
• A suboptimal solution to a hierarchical network design problem using dynamic programming
• An augmented arborescence formulation for the two-level network design problem
• The Hierarchical Network Design Problem: A New Formulation and Solution Procedures
• The Design of a Hierarchical Transportation Network with Transshipment Facilities
• A Dual-Based Algorithm for Multi-Level Network Design
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• Solving Steiner tree problems in graphs to optimality
• The Multi-Tier Tree Problem
• A branch-and-cut approach for minimum cost multi-level network design
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal design of hierarchical networks with free main path extremes