Aggregation in hub location problems
From MaRDI portal
Publication:833529
DOI10.1016/J.COR.2009.01.010zbMATH Open1176.90355OpenAlexW2104852650MaRDI QIDQ833529FDOQ833529
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)
Cites Work
- Title not available (Why is that?)
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- Title not available (Why is that?)
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Adapting polyhedral properties from facility to hub location problems
- Hub network design with single and multiple allocation: A computational study
- Error-bound driven demand point aggregation for the rectilinear distance p-center model
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- Objective function approximations in mathematical programming
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- On the single-assignment \(p\)-hub center problem
- A \(p\)-center grid-positioning aggregation procedure
- Aggregation Error Bounds for a Class of Location Models
- Row-Column Aggregation for Rectilinear Distance p-Median Problems
- On worst-case aggregation analysis for network location problems
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
- The \(p\)-hub center allocation problem
- Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem
Cited In (16)
- Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry
- The planar hub location problem: a probabilistic clustering approach
- A non-triangular hub location problem
- Aggregation without loss of optimality in competitive location models
- LTL logistics networks with differentiated services
- Exact approaches for static data segment allocation problem in an information network
- A note on node aggregation and Benders' decomposition
- A clustering approach to the planar hub location problem
- On worst-case aggregation analysis for network location problems
- Enumeration and search procedures for a hub location problem with economies of scale
- Aggregation error for location models: Survey and analysis
- The uncapacitated r‐allocation p‐hub center problem
- Machine learning augmented approaches for hub location problems
- A capacitated hub location problem in freight logistics multimodal networks
- An efficient heuristic for a hub location routing problem
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
Recommendations
- Hub Location Problems: The Location of Interacting Facilities 👍 👎
- Solution approaches to hub location problems 👍 👎
- Perspectives on modeling hub location problems 👍 👎
- Hub location problem in round-trip service applications 👍 👎
- Hub Location and the p-Hub Median Problem 👍 👎
- The hub location and routing problem 👍 👎
- Aggregation in the generalized transportation problem 👍 👎
- On hub location problems in geographically flexible networks 👍 👎
- Lower Bounds for the Hub Location Problem 👍 👎
- Improved hardness and approximation results for single allocation hub location problems 👍 👎
This page was built for publication: Aggregation in hub location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833529)
