The \(p\)-hub center allocation problem
From MaRDI portal
Publication:852943
DOI10.1016/j.ejor.2005.09.024zbMath1103.90057OpenAlexW2031373052MaRDI QIDQ852943
Timothy J. Lowe, Ann Melissa Campbell, Li Zhang
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.024
Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (16)
Aggregation in hub location problems ⋮ A 2-phase algorithm for solving the single allocation \(p\)-hub center problem ⋮ The stochastic \(p\)-hub center problem with service-level constraints ⋮ The two-echelon island fuel distribution problem ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ An efficient model for the multiple allocation hub maximal covering problem ⋮ The p-hub centre routing problem with emissions budget: formulation and solution procedure ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ Developing equilibrium optimization methods for hub location problems ⋮ LTL logistics networks with differentiated services ⋮ Network hub location problems: The state of the art ⋮ Single-allocation ordered median hub location problems ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution ⋮ Allocating nodes to hubs for minimizing the hubs processing resources: A case study ⋮ Hub Location Problems: The Location of Interacting Facilities
Uses Software
Cites Work
- Unnamed Item
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- Integer programming formulations of discrete hub location problems
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- On the single-assignment \(p\)-hub center problem
- A hybrid heuristic for the uncapacitated hub location problem
- The Latest Arrival Hub Location Problem
- Accumulation Point Location on Tree Networks for Guaranteed Time Distribution
- Polynomial algorithms in linear programming
- Khachiyan’s algorithm for linear programming
- The generalized P‐forest problem on a tree network
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- A dual algorithm for the uncapacitated hub location problem
- Algorithms for solving the conditional covering problem on paths
This page was built for publication: The \(p\)-hub center allocation problem
