Aggregation in hub location problems

DOI10.1016/J.COR.2009.01.010MaRDI QIDQ833529zbMATH OpenOpenAlexFDO

Authors Elena O. Gavriliouk

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

zbMATH Keywords

aggregationheuristicshub location

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

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

Cites work

• scientific article; zbMATH DE number 1803765 (Why is no real title available?)
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
• A \(p\)-center grid-positioning aggregation procedure
• Adapting polyhedral properties from facility to hub location problems
• Aggregation Error Bounds for a Class of Location Models
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• Analysis of centroid aggregation for the Euclidean distance \(p\)-median problem
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Error-bound driven demand point aggregation for the rectilinear distance p-center model
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Hub network design with single and multiple allocation: A computational study
• Integer programming formulations of discrete hub location problems
• Objective function approximations in mathematical programming
• On the single-assignment \(p\)-hub center problem
• On worst-case aggregation analysis for network location problems
• Row-Column Aggregation for Rectilinear Distance p-Median Problems
• The \(p\)-hub center allocation problem
• Uncapacitated single and multiple allocation \(p\)-hub center problems
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem

Cited in

(16)

• The planar hub location problem: a probabilistic clustering approach
• A capacitated hub location problem in freight logistics multimodal networks
• A non-triangular hub location problem
• LTL logistics networks with differentiated services
• A clustering approach to the planar hub location problem
• On worst-case aggregation analysis for network location problems
• A note on node aggregation and Benders' decomposition
• Enumeration and search procedures for a hub location problem with economies of scale
• Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry
• An efficient heuristic for a hub location routing problem
• Aggregation error for location models: Survey and analysis
• Machine learning augmented approaches for hub location problems
• Aggregation without loss of optimality in competitive location models
• General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
• The uncapacitated r‐allocation p‐hub center problem
• Exact approaches for static data segment allocation problem in an information network

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)