Solution algorithms for the capacitated single allocation hub location problem
From MaRDI portal
(Redirected from Publication:1290137)
Recommendations
- A Heuristic for the Capacitated Single Allocation Hub Location Problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Solving a capacitated hub location problem
- Capacitated single allocation hub location problem-A bi-criteria approach
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- An improved algorithm for fixed-hub single allocation problems
- Improved hardness and approximation results for single allocation hub location problems
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- Lower bounding procedures for the single allocation hub location problem
- A branch and cut algorithm for hub location problems with single assignment
Cited in
(81)- Multiple allocation hub-and-spoke network design under hub congestion
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- An \(M/M/c\) queue model for hub covering location problem
- A branch and cut algorithm for hub location problems with single assignment
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Proprietor and customer costs in the incomplete hub location-routing network topology
- The \(p\)-hub center allocation problem
- Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm
- Single-allocation ordered median hub location problems
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- Logistics network based on an improved ant colony algorithm
- Stochastic single-allocation hub location
- Stochastic hub location problems with Bernoulli demands
- The tree of hubs location problem
- Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- A decomposition approach for single allocation hub location problems with multiple capacity levels
- Perspectives on modeling hub location problems
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities
- A parallel adaptive memory algorithm for the capacitated modular hub location problem
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- A comparative study of different formulations for the capacitated discrete ordered median problem
- The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms
- Exact procedures for solving the discrete ordered median problem
- Endogenous effects of hubbing on flow intensities
- Fuzzy facility location-allocation problem under the Hurwicz criterion
- Solving the hub location problem with modular link capacities
- A mixed-integer approach to Core-Edge design of storage area networks
- Efficient algorithms for the capacitated concentrator location problem
- An improved algorithm for fixed-hub single allocation problems
- On the Quadratic Programming Approach for Hub Location Problems
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
- Reliable single allocation hub location problem under hub breakdowns
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- Multi-period single-allocation hub location-routing: models and heuristic solutions
- A parametric approach for a nonlinear discrete location problem
- The hub location and pricing problem
- Modeling congestion and service time in hub location problems
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- The capacitated facility location-allocation problem under uncertain environment
- The capacitated directed cycle hub location and routing problem under congestion
- Matheuristics for optimizing the network in German wagonload traffic
- Network hub location problems: The state of the art
- Solving a capacitated hub location problem
- Preprocessing and cutting for multiple allocation hub location problems.
- A new formulation and branch-and-cut method for single-allocation hub location problems
- Hub-and-spoke network design with congestion
- Hub location problems: the location of interacting facilities
- Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- An efficient model for the multiple allocation hub maximal covering problem
- Capacitated single allocation hub location problem-A bi-criteria approach
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
- HubLocator: An exact solution method for the multiple allocation hub location problem
- Multi-period hub network design problems with modular capacities
- General network design: a unified view of combined location and network design problems
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Tight bounds from a path based formulation for the tree of hub location problem
- Solution approaches to hub location problems
- A Heuristic for the Capacitated Single Allocation Hub Location Problem
- A fuzzy programming approach for dynamic virtual hub location problem
- The p-hub centre routing problem with emissions budget: formulation and solution procedure
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
- Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
- Multiple allocation hub location with service level constraints for two shipment classes
- A fuzzy algorithm for continuous capacitated location allocation model with risk consideration
- An intermodal hub location problem for container distribution in Indonesia
- Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
- A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands
- Machine learning augmented approaches for hub location problems
- Scalable vertiport hub location selection for air taxi operations in a metropolitan region
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion
- Multi-period hub set covering problems with flexible radius: a modified genetic solution
- Single allocation hub location with heterogeneous economies of scale
This page was built for publication: Solution algorithms for the capacitated single allocation hub location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290137)
