Perspectives on modeling hub location problems
From MaRDI portal
Publication:2029941
DOI10.1016/j.ejor.2020.09.039zbMath1487.90425OpenAlexW3091452775WikidataQ115162801 ScholiaQ115162801MaRDI QIDQ2029941
Morton E. O'Kelly, James F. Campbell, Sibel A. Alumur, Vladimir Marianov, Bahar Yetis Kara, Iván A. Contreras
Publication date: 4 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.09.039
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
The hub location and pricing problem ⋮ Competitive multiple allocation hub location problem considering primary and backup routes ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ Stochastic hub location problems with Bernoulli demands ⋮ Single Allocation Hub Location with Heterogeneous Economies of Scale ⋮ Planning and design of intermodal hub networks: a literature review ⋮ Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs ⋮ Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem ⋮ The profit-oriented hub line location problem with elastic demand ⋮ On hub location problems in geographically flexible networks ⋮ A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands ⋮ Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation ⋮ The synchronized multi-commodity multi-service transshipment-hub location problem with cyclic schedules ⋮ Multiple allocation hub location with service level constraints for two shipment classes ⋮ Multi-period single-allocation hub location-routing: models and heuristic solutions ⋮ A parallel adaptive memory algorithm for the capacitated modular hub location problem ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ Integrating micro-depot freight transport in existing public transport services ⋮ An alternative approach to address uncertainty in hub location ⋮ Integrated hub location and flow processing schedule problem under renewable capacity constraint ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion ⋮ Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
Cites Work
- Unnamed Item
- Hub location problems with price sensitive demands
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- Hub location under competition
- A Stackelberg hub arc location model for a competitive environment
- A branch-and-cut algorithm for the hub location and routing problem
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Allocation strategies in hub networks
- Stochastic uncapacitated hub location
- Multi-period hub network design problems with modular capacities
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Adapting polyhedral properties from facility to hub location problems
- A branch-and-cut algorithm for the partitioning-hub location-routing problem
- Single-allocation ordered median hub location problems
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- Tight bounds from a path based formulation for the tree of hub location problem
- A conditional \(p\)-hub location problem with attraction functions
- The stochastic \(p\)-hub center problem with service-level constraints
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- A hub location problem with fully interconnected backbone and access networks
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- Finding the conditional location of a median path on a tree
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- A study of the quadratic semi-assignment polytope
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Location of hubs in a competitive environment
- Integer programming formulations of discrete hub location problems
- Preprocessing and cutting for multiple allocation hub location problems.
- Network cost minimization using threshold-based discounting
- Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
- An exact algorithm for the modular hub location problem with single assignments
- Routing and scheduling decisions in the hierarchical hub location problem
- Heuristics for the capacitated modular hub location problem
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- Reliable single allocation hub location problem under hub breakdowns
- Exact and heuristic approaches for the cycle hub location problem
- Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem
- An intermodal hub location problem for container distribution in Indonesia
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations
- A multiobjective hub-airport location problem for an airline network design
- Branch-and-price-and-cut for a service network design and hub location problem
- Exact solution of hub network design problems with profits
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
- Hub-and-spoke network design with congestion
- A branch and cut algorithm for hub location problems with single assignment
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs
- On carriers collaboration in hub location problems
- Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
- Modeling congestion and service time in hub location problems
- A competitive hub location and pricing problem
- Endogenous effects of hubbing on flow intensities
- Topological design of a two-level network with ring-star configuration
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- An improved linearization strategy for zero-one quadratic programming problems
- Star \(p\)-hub median problem with modular arc capacities
- Network hub location problems: The state of the art
- Distinguishing multiproduct economies of scale from economies of density on a fixed-size transport network
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion
- Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
- Hub Location as the Minimization of a Supermodular Set Function
- The Latest Arrival Hub Location Problem
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Release Time Scheduling and Hub Location for Next-Day Delivery
- Projecting the flow variables for hub location problems
- A hub covering network design problem for cargo applications in Turkey
- A hub covering model for cargo delivery systems
- Designing satellite communication networks by zero—one quadratic programming
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- A hub location problem in designing digital data service networks: Lagrangian relaxation approach
- Airline network design and hub location problems
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- The ring/κ‐rings network design problem: Model and branch‐and‐cut algorithm
- A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- An improved mixed integer program for single allocation hub location problems with stepwise cost function
- Solving the hub location problem in a star–star network
- Conditional Location Problems on Networks and in the Plane
