The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
From MaRDI portal
Publication:1725627
DOI10.1016/j.cor.2018.09.006zbMath1458.90449OpenAlexW2889896490WikidataQ129209667 ScholiaQ129209667MaRDI QIDQ1725627
Andreas T. Ernst, Hamid Mokhtar, Mohan Krishnamoorthy
Publication date: 14 February 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.09.006
Related Items (6)
Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem ⋮ Planning and design of intermodal hub networks: a literature review ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem ⋮ A novel two-echelon hierarchical location-allocation-routing optimization for green energy-efficient logistics systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact approaches for static data segment allocation problem in an information network
- Allocation strategies in hub networks
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Strategic network restoration
- Practical enhancements to the Magnanti-Wong method
- 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
- On tabu search for the location of interacting hub facilities
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- The \(q\)-ad hoc hub location problem for multi-modal networks
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- Enumeration and search procedures for a hub location problem with economies of scale
- Star \(p\)-hub median problem with modular arc capacities
- Network hub location problems: The state of the art
- A note on the selection of Benders' cuts
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- A hub covering model for cargo delivery systems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Neural versus traditional approaches to the location of interacting hub facilities
- Airline network design and hub location problems
- Hub Location and the p-Hub Median Problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems
- The single allocation problem in the interacting three-hub network
This page was built for publication: The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
