An approximation algorithm for multi-allocation hub location problems
From MaRDI portal
Cites work
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A dual algorithm for the uncapacitated hub location problem
- A method for solving to optimality uncapacitated location problems
- A new approximation algorithm for the k-facility location problem
- An alternative approach to address uncertainty in hub location
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Approximation algorithms for median hub location problems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Heuristics for the fixed cost median problem
- Hub Location and the p-Hub Median Problem
- HubLocator: An exact solution method for the multiple allocation hub location problem
- Integer programming formulations of discrete hub location problems
- Machine learning augmented approaches for hub location problems
- Network hub location problems: The state of the art
- On the selection of hub airports for an airline hub-and-spoke system
- Perspectives on modeling hub location problems
- Solving the Hub location problem in telecommunication network design: A local search approach
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- Stochastic air freight hub location and flight routes planning
This page was built for publication: An approximation algorithm for multi-allocation hub location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6931513)
