Network hub location problems: The state of the art
From MaRDI portal
Publication:2482813
Recommendations
Cites work
- A Note on “The Latest Arrival Hub Location Problem”
- A branch and cut algorithm for hub location problems with single assignment
- A clustering approach to the planar hub location problem
- A dual algorithm for the uncapacitated hub location problem
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- A hub covering model for cargo delivery systems
- A hybrid heuristic for the uncapacitated hub location problem
- A linear program for the two-hub location problem
- A quadratic integer program for the location of interacting hub facilities
- A survey of optimization models for train routing and scheduling
- Accumulation Point Location on Tree Networks for Guaranteed Time Distribution
- Adapting polyhedral properties from facility to hub location problems
- Airline network design and hub location problems
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- An efficient procedure for designing single allocation hub and spoke systems
- An exact solution procedure for a cluster hub location problem
- Avoiding local optima in the p-hub location problem using tabu search and GRASP
- Dual-based approach for a hub network design problem under non-restrictive policy
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- Enumeration and search procedures for a hub location problem with economies of scale
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Heuristics for the p-hub location problem
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Hub Location and the p-Hub Median Problem
- 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
- Hub-and-spoke network design with congestion
- HubLocator: An exact solution method for the multiple allocation hub location problem
- Integer programming formulations of discrete hub location problems
- Interacting New Facilities and Location-Allocation Problems
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Lower Bounds for the Hub Location Problem
- Network cost minimization using threshold-based discounting
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- Neural versus traditional approaches to the location of interacting hub facilities
- New formulations for the uncapacitated multiple allocation hub location problem
- ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS
- On ``A quadratic integer program for the location of interacting hub facilities
- On tabu search for the location of interacting hub facilities
- On the Location of Hub Facilities
- On the selection of hub airports for an airline hub-and-spoke system
- On the single-assignment \(p\)-hub center problem
- Planning models for freight transportation
- Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
- Preprocessing and cutting for multiple allocation hub location problems.
- Projecting the flow variables for hub location problems
- Solution algorithms for the capacitated single allocation hub location problem
- Solution approaches to hub location problems
- Solving large single allocation \(p\)-hub problems with two or three hubs
- Solving the Hub location problem in telecommunication network design: A local search approach
- Solving the hub location problem with modular link capacities
- Solving the uncapacitated hub location problem using genetic algorithms
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- The \(p\)-hub center allocation problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- The hub location and routing problem
- The latest arrival hub location problem
- The single allocation problem in the interacting three-hub network
- The single-assignment hub covering problem: Models and linearizations
- Tight linear programming relaxations of uncapacitated p-hub median problems
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- Uncapacitated single and multiple allocation \(p\)-hub center problems
Cited in
(only showing first 100 items - show all)- Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
- Multiple allocation tree of hubs location problem for non-complete networks
- A new formulation and branch-and-cut method for single-allocation hub location problems
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
- A review of transport market modeling using game-theoretic principles
- Public transportation hub location with stochastic demand: an improved approach based on multiple attribute group decision-making
- An intermodal hub location problem for container distribution in Indonesia
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
- Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem
- OR models in urban service facility location: a critical review of applications and future developments
- Integrated inventory control and facility location decisions in a multi-echelon supply chain network with hubs
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Solving partitioning-hub location-routing problem using DCA
- Design of a reliable multi-modal multi-commodity model for hazardous materials transportation under uncertainty
- scientific article; zbMATH DE number 1803765 (Why is no real title available?)
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities
- New complexity results for the \(p\)-hub median problem
- Allocation strategies in hub networks
- Stochastic uncapacitated hub location
- Heuristic algorithms for the single allocation p-hub center problem with routing considerations
- Hub location with congestion and time-sensitive demand
- Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem
- Selection of secondary hub airport location based on connectivity and green airport solutions
- Hub location-allocation in intermodal logistic networks
- A Benders decomposition for hub location problems arising in public transport
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study
- Less is more: general variable neighborhood search for the capacitated modular hub location problem
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- The parameterized complexity of terminal monitoring set
- scientific article; zbMATH DE number 1153375 (Why is no real title available?)
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- Hub location for time definite transportation
- Multiple allocation hub-and-spoke network design under hub congestion
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- Integrated multi-level intermodal network design problem: a sustainable approach, based on competition of rail and road transportation systems
- Reliable hub-and-spoke network design problems under uncertainty through multi-objective programming
- The tree of hubs location problem
- One-way and two-way cost allocation in hub network problems
- Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
- Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem
- Branch-and-price-and-cut for a service network design and hub location problem
- Upgrading nodes in tree-shaped hub location
- Optimizing fuzzy \( p\)-hub center problem with generalized value-at-risk criterion
- \(p\)-hub median problem for non-complete networks
- A biased random-key genetic algorithm for the tree of hubs location problem
- The complexity landscape of decompositional parameters for ILP
- Solving the Hub location problem in telecommunication network design: A local search approach
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Hardness and approximation for the star \(\beta \)-hub routing cost problem in \(\varDelta_\beta \)-metric graphs
- A parameterized approximation algorithm for the multiple allocation \(k\)-hub center
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Flow shipment scheduling in an incomplete hub location-routing network design problem
- Multimodal freight transportation planning: a literature review
- Synchronization in cross-docking networks: a research classification and framework
- 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
- The p-hub centre routing problem with emissions budget: formulation and solution procedure
- Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network
- Integrated hub location and flow processing schedule problem under renewable capacity constraint
- Oracle-based algorithms for binary two-stage robust optimization
- Two heuristic solution concepts for the vehicle selection problem in line haul transports
- On Local Search and Placement of Meters in Networks
- Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
- Approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problems
- The \(q\)-ad hoc hub location problem for multi-modal networks
- Heuristic algorithms for solving an integrated dynamic center facility location -- network design model
- A decomposition approach for single allocation hub location problems with multiple capacity levels
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
- Endogenous effects of hubbing on flow intensities
- Spatial analysis of single allocation hub location problems
- Trade-offs on the location of the core node in a network
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
- The uncapacitated hub location problem in networks under decentralized management
- Single-allocation ordered median hub location problems
- Competitive multiple allocation hub location problem considering primary and backup routes
- The stochastic p-hub center problem with service-level constraints
- General network design: a unified view of combined location and network design problems
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- A capacitated hub location problem under hose demand uncertainty
- Scalable vertiport hub location selection for air taxi operations in a metropolitan region
- Optimal wholesale facilities location within the fruit and vegetables supply chain with bimodal transportation options: an LP-MIP heuristic approach
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- Hub location problems: the location of interacting facilities
- A 2-phase algorithm for solving the single allocation p-hub center problem
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war
- A parallel adaptive memory algorithm for the capacitated modular hub location problem
- The planar hub location problem: a probabilistic clustering approach
- An exact algorithm for the modular hub location problem with single assignments
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- Heuristics for the capacitated modular hub location problem
- 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
- A non-triangular hub location problem
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion
- Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach
- Hub location under competition
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
This page was built for publication: Network hub location problems: The state of the art
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482813)
