Solving the hub location problem in a star–star network

DOI10.1002/net.20193zbMath1146.90035OpenAlexW4246852160MaRDI QIDQ5433190

Hande Yaman, Martine Labbé

Publication date: 8 January 2008

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20193

zbMATH Keywords

Lagrangian relaxationbranch and cuthub locationpolyhedral analysisstar-star network

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Related Items (30)

Survivability in hierarchical telecommunications networks ⋮ A conditional \(p\)-hub location problem with attraction functions ⋮ Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach ⋮ Exact and heuristic algorithms for the design of hub networks with multiple lines ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ Scatter search for an uncapacitated \(p\)-hub median problem ⋮ An exact algorithm for the modular hub location problem with single assignments ⋮ Hub Location as the Minimization of a Supermodular Set Function ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ General network design: a unified view of combined location and network design problems ⋮ The profit-oriented hub line location problem with elastic demand ⋮ Exact and heuristic approaches for the cycle hub location problem ⋮ A branch‐and‐cut algorithm for hub network design problems with profits ⋮ A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case ⋮ Allocation strategies in hub networks ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ An intermodal hub location problem for container distribution in Indonesia ⋮ Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry ⋮ Exact solution of hub network design problems with profits ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ Single-allocation ordered median hub location problems ⋮ Alternate solution approaches for competitive hub location problems ⋮ Perspectives on modeling hub location problems ⋮ The capacitated directed cycle hub location and routing problem under congestion ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ Towards optimizing the deployment of optical access networks ⋮ A combined average-case and worst-case analysis for an integrated hub location and revenue management problem

Uses Software

• ABACUS
• OR-Library

Cites Work

• Concentrator location in telecommunications networks.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving the hub location problem in a star–star network