Perspectives on modeling hub location problems
From MaRDI portal
Publication:2029941
DOI10.1016/J.EJOR.2020.09.039zbMATH Open1487.90425OpenAlexW3091452775WikidataQ115162801 ScholiaQ115162801MaRDI QIDQ2029941FDOQ2029941
Authors: Sibel A. Alumur, James F. Campbell, Vladimir Marianov, Morton E. O'Kelly, Ivan Contreras, Bahar Y. Kara 
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
Recommendations
Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- 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
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- Preprocessing and cutting for multiple allocation hub location problems.
- Hub-and-spoke network design with congestion
- 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
- A competitive hub location and pricing problem
- Network hub location problems: The state of the art
- Hub location problems with price sensitive demands
- Benders decomposition for large-scale uncapacitated hub location
- Title not available (Why is that?)
- A hub covering model for cargo delivery systems
- Allocation strategies in hub networks
- Stochastic uncapacitated hub location
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Adapting polyhedral properties from facility to hub location problems
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- 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
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- Solution algorithms for the capacitated single allocation hub location problem
- A branch and cut algorithm for hub location problems with single assignment
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- An efficient procedure for designing single allocation hub and spoke systems
- Hub arc location problems: I. Introduction and results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Projecting the flow variables for hub location problems
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
- Single-allocation ordered median hub location problems
- Tight bounds from a path based formulation for the tree of hub location problem
- The stochastic \(p\)-hub center problem with service-level constraints
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- Branch and price for large-scale capacitated hub location problems with single assignment
- A hub covering network design problem for cargo applications in Turkey
- Exact and heuristic approaches for the cycle hub location problem
- Topological design of a two-level network with ring-star configuration
- Hub location as the minimization of a supermodular set function
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- Solving the hub location problem in a star–star network
- A study of the quadratic semi-assignment polytope
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Location of hubs in a competitive environment
- The latest arrival hub location problem
- 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
- Conditional Location Problems on Networks and in the Plane
- A conditional \(p\)-hub location problem with attraction functions
- Network cost minimization using threshold-based discounting
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- An improved linearization strategy for zero-one quadratic programming problems
- Star \(p\)-hub median problem with modular arc capacities
- Airline network design and hub location problems
- A branch-and-cut algorithm for the partitioning-hub location-routing problem
- A hub location problem with fully interconnected backbone and access networks
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- Modeling congestion and service time in hub location problems
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A multiobjective hub-airport location problem for an airline network design
- Multi-period hub network design problems with modular capacities
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
- Routing and scheduling decisions in the hierarchical hub location problem
- Endogenous effects of hubbing on flow intensities
- Release time scheduling and hub location for next-day delivery
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
- Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem
- Finding the conditional location of a median path on a tree
- A hub location problem in designing digital data service networks: Lagrangian relaxation approach
- Designing satellite communication networks by zero—one quadratic programming
- Branch-and-price-and-cut for a service network design and hub location problem
- Exact solution of hub network design problems with profits
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
- An exact algorithm for the modular hub location problem with single assignments
- 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
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs
- 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
- A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- On carriers collaboration in hub location problems
- Distinguishing multiproduct economies of scale from economies of density on a fixed-size transport network
- The ring/\(\kappa\)-rings network design problem: model and branch-and-cut algorithm
- An improved mixed integer program for single allocation hub location problems with stepwise cost function
Cited In (33)
- Hub location with congestion and time-sensitive demand
- A multi-period vaccines supply chain network design with capacity expansion and different replenishment cycles under uncertain demand
- Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem
- Competitive location models: a review
- Integrating micro-depot freight transport in existing public transport services
- The profit-oriented hub line location problem with elastic demand
- Integrated hub location and flow processing schedule problem under renewable capacity constraint
- Competitive multiple allocation hub location problem considering primary and backup routes
- A parallel adaptive memory algorithm for the capacitated modular hub location problem
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
- Multi-period single-allocation hub location-routing: models and heuristic solutions
- A Stackelberg hub arc location model for a competitive environment
- Modeling congestion and service time in hub location problems
- Stochastic hub location problems with Bernoulli demands
- Planning and design of intermodal hub networks: a literature review
- The synchronized multi-commodity multi-service transshipment-hub location problem with cyclic schedules
- A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands
- Enumeration and search procedures for a hub location problem with economies of scale
- Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs
- Aggregation in hub location problems
- On hub location problems in geographically flexible networks
- Solution approaches to hub location problems
- An alternative approach to address uncertainty in hub location
- Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation
- Machine learning augmented approaches for hub location problems
- Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
- Hub location problems in urban traffic networks
- Multiple allocation hub location with service level constraints for two shipment classes
- Single allocation hub location with heterogeneous economies of scale
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- A co-opetitive framework for the hub location problems in transportation networks
- The hub location and pricing problem
- A new formulation and branch-and-cut method for single-allocation hub location problems
This page was built for publication: Perspectives on modeling hub location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029941)
