A branch and cut algorithm for the hierarchical network design problem

DOI10.1016/J.EJOR.2008.12.022MaRDI QIDQ2379520zbMATH OpenOpenAlexFDO

Authors Carlos Obreque, Macarena Donoso, Gabriel Gutiérrez, Vladimir Marianov

Publication date 19 March 2010

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10533/141020

zbMATH Keywords

cutting planesextensive facility location

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Recommendations

• A branch-and-cut approach for minimum cost multi-level network design
• The hierarchical network design problem
• Network design problem with cut constraints
• A branch-and-cut algorithm for two-level survivable network design problems
• scientific article; zbMATH DE number 4152177

Cites work

• scientific article; zbMATH DE number 4152177 (Why is no real title available?)
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• A Dual-Based Algorithm for Multi-Level Network Design
• A branch-and-cut approach for minimum cost multi-level network design
• A suboptimal solution to a hierarchical network design problem using dynamic programming
• An augmented arborescence formulation for the two-level network design problem
• An efficient genetic algorithm for the \(p\)-median problem
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• Optimal design of hierarchical networks with free main path extremes
• Reducing the hierarchical network design problem
• Solution of a Large-Scale Traveling-Salesman Problem
• Solving Steiner tree problems in graphs to optimality
• The Design of a Hierarchical Transportation Network with Transshipment Facilities
• The Hierarchical Network Design Problem: A New Formulation and Solution Procedures
• The Multi-Tier Tree Problem
• The hierarchical network design problem
• The hierarchical network design problem with multiple primary paths
• The hierarchical network design problem with transshipment facilities
• The multi-weighted Steiner tree problem
• Vehicle routing with split deliveries

Cited in

(12)

• Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
• The hierarchical network design problem with multiple primary paths
• Branch-and-price algorithm for the resilient multi-level hop-constrained network design
• Branch-and-cut methods for the network design problem with vulnerability constraints
• A branch-and-cut algorithm for capacitated network design problems
• scientific article; zbMATH DE number 4049150 (Why is no real title available?)
• A taxonomy of multilayer network design and a survey of transportation and telecommunication applications
• Balanced-flow algorithm for path network planning in hierarchical spaces
• scientific article; zbMATH DE number 151869 (Why is no real title available?)
• A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
• Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
• A branch-and-cut approach for minimum cost multi-level network design

Describes a project that uses

Uses Software

• SteinLib

This page was built for publication: A branch and cut algorithm for the hierarchical network design problem

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