Adjustable robust balanced hub location problem with uncertain transportation cost

DOI10.1007/s40314-020-01405-2zbMath1461.90067OpenAlexW3120062519MaRDI QIDQ2027703

Reza Rahmati, Hossein Neghabi

Publication date: 28 May 2021

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-020-01405-2

zbMATH Keywords

adjustable robust optimizationPareto-optimal cutBenders decomposition algorithmbalanced hub locationuncertain transportation cost

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80) Robustness in mathematical programming (90C17)

Related Items

Integrated facility location and capacity planning under uncertainty, Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion

Cites Work

• Unnamed Item
• Robust optimization approach to capacitated single and multiple allocation hub location problems
• Stochastic uncapacitated hub location
• Flow shipment scheduling in an incomplete hub location-routing network design problem
• A quadratic integer program for the location of interacting hub facilities
• Partitioning procedures for solving mixed-variables programming problems
• Integer programming formulations of discrete hub location problems
• Robust discrete optimization and network flows
• Adjustable robust solutions of uncertain linear programs
• A capacitated hub location problem under hose demand uncertainty
• 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
• Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry
• A single allocation hub location and pricing problem
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Multistage Adaptive Robust Optimization for the Unit Commitment Problem
• Strong Duality in Robust Convex Programming: Complete Characterizations
• Theory and Applications of Robust Optimization
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming