Exact algorithms for the robust uncapacitated multiple allocation p-hub median problem
From MaRDI portal
Publication:2673530
DOI10.1007/S11590-021-01799-WzbMATH Open1493.90118OpenAlexW3196564838MaRDI QIDQ2673530FDOQ2673530
Publication date: 10 June 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-021-01799-w
Recommendations
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
- A capacitated hub location problem under hose demand uncertainty
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- Risk-averse hub location: formulation and solution approach
- Adjustable robust balanced hub location problem with uncertain transportation cost
Mixed integer programming (90C11) Discrete location and assignment (90B80) Robustness in mathematical programming (90C17)
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- A quadratic integer program for the location of interacting hub facilities
- Robust discrete optimization and network flows
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Network hub location problems: The state of the art
- Benders decomposition for large-scale uncapacitated hub location
- A hub covering model for cargo delivery systems
- Stochastic uncapacitated hub location
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Location models for airline hubs behaving as \(M/D/c\) queues.
- The stochastic \(p\)-hub center problem with service-level constraints
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- Perspectives on modeling hub location problems
- A military maintenance planning and scheduling problem
- Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
- A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method
- Benders decomposition algorithms for two variants of the single allocation hub location problem
Cited In (7)
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- Scatter search for an uncapacitated \(p\)-hub median problem
- A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems
- A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands
- An alternative approach to address uncertainty in hub location
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
This page was built for publication: Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673530)
