Aggregation in hub location problems
From MaRDI portal
Publication:833529
DOI10.1016/j.cor.2009.01.010zbMath1176.90355OpenAlexW2104852650MaRDI QIDQ833529
Publication date: 14 August 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.01.010
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A capacitated hub location problem in freight logistics multimodal networks ⋮ Exact approaches for static data segment allocation problem in an information network ⋮ The uncapacitated r‐allocation p‐hub center problem ⋮ A non-triangular hub location problem ⋮ The planar hub location problem: a probabilistic clustering approach ⋮ Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry ⋮ General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem ⋮ LTL logistics networks with differentiated services ⋮ Aggregation error for location models: Survey and analysis ⋮ An efficient heuristic for a hub location routing problem
Cites Work
- Unnamed Item
- Unnamed Item
- On worst-case aggregation analysis for network location problems
- Adapting polyhedral properties from facility to hub location problems
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- The \(p\)-hub center allocation problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- A \(p\)-center grid-positioning aggregation procedure
- Integer programming formulations of discrete hub location problems
- On the single-assignment \(p\)-hub center problem
- Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
- Objective function approximations in mathematical programming
- Hub network design with single and multiple allocation: A computational study
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Error-bound driven demand point aggregation for the rectilinear distance p-center model
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Aggregation Error Bounds for a Class of Location Models
- Row-Column Aggregation for Rectilinear Distance p-Median Problems
