A branch and cut algorithm for the hierarchical network design problem

DOI10.1016/J.EJOR.2008.12.022zbMATH Open1188.90051OpenAlexW2072701932MaRDI QIDQ2379520FDOQ2379520

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

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

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)

Cites Work

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

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
• Title not available (Why is that?)
• A taxonomy of multilayer network design and a survey of transportation and telecommunication applications
• Balanced-flow algorithm for path network planning in hierarchical spaces
• Title not available (Why is that?)
• 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

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)