Solving large single allocation \(p\)-hub problems with two or three hubs
From MaRDI portal
Publication:1595449
DOI10.1016/S0377-2217(99)00370-7zbMath0985.90064MaRDI QIDQ1595449
Publication date: 2 June 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Discrete location and assignment (90B80)
Related Items (20)
Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques ⋮ New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ An efficient model for the multiple allocation hub maximal covering problem ⋮ A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion ⋮ Allocation strategies in hub networks ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ Preprocessing and cutting for multiple allocation hub location problems. ⋮ Route planning for a mixed delivery system in long distance transportation and comparison with pure delivery systems ⋮ Star \(p\)-hub median problem with modular arc capacities ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ Network hub location problems: The state of the art ⋮ Hub-and-spoke network design with congestion ⋮ Solving the uncapacitated hub location problem using genetic algorithms ⋮ Unmanned aerial vehicle hub-location and routing for monitoring geographic borders ⋮ HubLocator: An exact solution method for the multiple allocation hub location problem ⋮ Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
Uses Software
Cites Work
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Heuristics for the p-hub location problem
- On ``A quadratic integer program for the location of interacting hub facilities
- A quadratic integer program for the location of interacting hub facilities
- An algorithm for the quadratic assignment problem using Benders' decomposition
- A linear program for the two-hub location problem
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- On the Location of Hub Facilities
- Interacting New Facilities and Location-Allocation Problems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Neural versus traditional approaches to the location of interacting hub facilities
- Hub Location and the p-Hub Median Problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Lower Bounds for the Hub Location Problem
- The single allocation problem in the interacting three-hub network
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
This page was built for publication: Solving large single allocation \(p\)-hub problems with two or three hubs
