A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems

DOI10.1007/978-3-319-89920-6_19zbMath1397.90243MaRDI QIDQ4685749

Andreas T. Ernst, Hamid Mokhtar, Mohan Krishnamoorthy

Publication date: 9 October 2018

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_19

zbMATH Keywords

accelerated Benders decomposition method; multiple allocation \(p\)-hub median problem; single allocation \(p\)-hub median problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B10: Deterministic network models in operations research

90B80: Discrete location and assignment

Related Items

The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems, An intermodal hub location problem for container distribution in Indonesia, Perspectives on modeling hub location problems

Cites Work

• Unnamed Item
• Benders decomposition for the uncapacitated multiple allocation hub location problem
• A quadratic integer program for the location of interacting hub facilities
• Partitioning procedures for solving mixed-variables programming problems
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Integer programming formulations of discrete hub location problems
• Benders Decomposition for Large-Scale Uncapacitated Hub Location
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Hub Location and the p-Hub Median Problem
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems