A capacitated hub location problem under hose demand uncertainty
From MaRDI portal
Publication:1651522
DOI10.1016/j.cor.2017.06.011zbMath1391.90388OpenAlexW2723729301MaRDI QIDQ1651522
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/37409
robustnessBenders decompositiondemand uncertaintymultiple allocationhub locationhose modelcapacitated hubs
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items
Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ Risk-averse hub location: formulation and solution approach ⋮ Stochastic hub location problems with Bernoulli demands ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands ⋮ The synchronized multi-commodity multi-service transshipment-hub location problem with cyclic schedules ⋮ Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem ⋮ Adjustable robust balanced hub location problem with uncertain transportation cost ⋮ Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
Uses Software
Cites Work
- Unnamed Item
- Stochastic uncapacitated hub location
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Adapting polyhedral properties from facility to hub location problems
- Stochastic air freight hub location and flight routes planning
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- The stochastic \(p\)-hub center problem with service-level constraints
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- Design of trees in the hose model: the balanced case
- Restricted robust uniform matroid maximization under interval uncertainty
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Selected topics in robust convex optimization
- Partitioning procedures for solving mixed-variables programming problems
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Robust solutions of uncertain linear programs
- Integer programming formulations of discrete hub location problems
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Robust discrete optimization and network flows
- Preprocessing and cutting for multiple allocation hub location problems.
- Adjustable robust solutions of uncertain linear programs
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Solving a capacitated hub location problem
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Network hub location problems: The state of the art
- Strong formulations of robust mixed 0-1 programming
- Robust Convex Optimization
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
- ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS
- Provisioning virtual private networks under traffic uncertainty
- Hardness of robust network design
- The Price of Robustness
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- A dual algorithm for the uncapacitated hub location problem
- Hub Location and the p-Hub Median Problem
- Designing Least-Cost Nonblocking Broadband Networks
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Properties of vertex packing and independence system polyhedra
- Robust capacity expansion of network flows
- Robust solutions for network design under transportation cost and demand uncertainty
- The robust spanning tree problem with interval data
- HubLocator: An exact solution method for the multiple allocation hub location problem
