A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
From MaRDI portal
Publication:408393
DOI10.1016/j.orl.2011.06.015zbMath1235.90078OpenAlexW1996844059MaRDI QIDQ408393
Ricardo Saraiva de Camargo, Ricardo P. M. Ferreira, Gilberto~jun. de Miranda
Publication date: 5 April 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.06.015
mixed integer nonlinear programmingBenders decompositionhub-and-spoke networksouter-approximation algorithms
Mixed integer programming (90C11) Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (22)
Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion ⋮ A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks ⋮ Benders Decomposition for Production Routing Under Demand Uncertainty ⋮ A branch-and-check approach for a wind turbine maintenance scheduling problem ⋮ Exact approaches for static data segment allocation problem in an information network ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment ⋮ Incremental optimization of hub and spoke network for the spokes' numbers and flow ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ Skyport location problem for urban air mobility system ⋮ Multiple allocation hub location with service level constraints for two shipment classes ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment ⋮ Alternate second order conic program reformulations for hub location under stochastic demand and congestion ⋮ The Benders decomposition algorithm: a literature review ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ Perspectives on modeling hub location problems ⋮ The capacitated directed cycle hub location and routing problem under congestion ⋮ Modeling congestion and service time in hub location problems ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
Cites Work
- Unnamed Item
- Multiple allocation hub-and-spoke network design under hub congestion
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Practical enhancements to the Magnanti-Wong method
- Partitioning procedures for solving mixed-variables programming problems
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Integer programming formulations of discrete hub location problems
- Solving mixed integer nonlinear programs by outer approximation
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Solving large single allocation \(p\)-hub problems with two or three hubs
- Hub-and-spoke network design with congestion
- A branch and cut algorithm for hub location problems with single assignment
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Network hub location problems: The state of the art
- Generalized Benders decomposition
- A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- A dual algorithm for the uncapacitated hub location problem
- A delay dependent queue discipline
This page was built for publication: A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
