A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems
DOI10.1007/978-3-319-89920-6_19zbMath1397.90243OpenAlexW2803135057MaRDI 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
accelerated Benders decomposition methodmultiple allocation \(p\)-hub median problemsingle allocation \(p\)-hub median problem
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (3)
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
This page was built for publication: A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems