Robust optimization approach to capacitated single and multiple allocation hub location problems
From MaRDI portal
(Redirected from Publication:291363)
Recommendations
- An alternative approach to address uncertainty in hub location
- Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem
- A capacitated hub location problem under hose demand uncertainty
- An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
Cites work
- A branch and cut algorithm for hub location problems with single assignment
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- A hybrid heuristic for the uncapacitated hub location problem
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- A quadratic integer program for the location of interacting hub facilities
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- Adapting polyhedral properties from facility to hub location problems
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- An M/M/c queue model for hub covering location problem
- An efficient procedure for designing single allocation hub and spoke systems
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- Benders decomposition for large-scale uncapacitated hub location
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Capacitated single allocation hub location problem-A bi-criteria approach
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Hub Location and the p-Hub Median Problem
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
- Hub arc location problems: I. Introduction and results
- Hub location problems in urban traffic networks
- Hub network design with single and multiple allocation: A computational study
- HubLocator: An exact solution method for the multiple allocation hub location problem
- Integer programming formulations of discrete hub location problems
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Multiple allocation hub-and-spoke network design under hub congestion
- Network hub location problems: The state of the art
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- New formulations for the uncapacitated multiple allocation hub location problem
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS
- On tabu search for the location of interacting hub facilities
- Preprocessing and cutting for multiple allocation hub location problems.
- Projecting the flow variables for hub location problems
- Single-allocation ordered median hub location problems
- Solution algorithms for the capacitated single allocation hub location problem
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
- Solving large single allocation \(p\)-hub problems with two or three hubs
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- Stochastic air freight hub location and flight routes planning
- Stochastic uncapacitated hub location
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
- The single allocation problem in the interacting three-hub network
- The stochastic p-hub center problem with service-level constraints
- The tree of hubs location problem
- Tight bounds from a path based formulation for the tree of hub location problem
- Tight linear programming relaxations of uncapacitated p-hub median problems
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
Cited in
(17)- Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach
- Reliable hub-and-spoke network design problems under uncertainty through multi-objective programming
- Adjustable robust balanced hub location problem with uncertain transportation cost
- A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds
- 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
- Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment
- A single allocation hub location and pricing problem
- Solving the robust two-stage capacitated facility location problem with uncertain transportation costs
- On hub location problems in geographically flexible networks
- An alternative approach to address uncertainty in hub location
- Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
- Robust stochastic facility location: sensitivity analysis and exact solution
- Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- Robust sustainable multi-period hub location considering uncertain time-dependent demand
This page was built for publication: Robust optimization approach to capacitated single and multiple allocation hub location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q291363)
