Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (89)

New formulations for the uncapacitated multiple allocation hub location problem ⋮ Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ Multiple allocation hub-and-spoke network design under hub congestion ⋮ Aggregation in hub location problems ⋮ New simple and efficient heuristics for the uncapacitated single allocation hub location problem ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Upgrading nodes in tree-shaped hub location ⋮ A cost allocation problem arising in hub-spoke network systems ⋮ A capacitated hub location problem in freight logistics multimodal networks ⋮ The hub location and pricing problem ⋮ Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach ⋮ Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ Risk-averse hub location: formulation and solution approach ⋮ Hub location under competition ⋮ A note on ``Location of hubs in a competitive environment ⋮ Solving a capacitated hub location problem ⋮ Formulating and solving splittable capacitated multiple allocation hub location problems ⋮ A two-level location-allocation problem in designing local access fiber optic networks ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ A genetic algorithm for the uncapacitated single allocation planar hub location problem ⋮ An exact algorithm for the modular hub location problem with single assignments ⋮ Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems ⋮ \(p\)-hub median problem for non-complete networks ⋮ Reliable single allocation hub location problem under hub breakdowns ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ An exact solution procedure for a cluster hub location problem ⋮ Single Allocation Hub Location with Heterogeneous Economies of Scale ⋮ Hub Location as the Minimization of a Supermodular Set Function ⋮ On the enrouting protocol problem under uncertainty ⋮ A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ 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 ⋮ Design of intermodal logistics networks with hub delays ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ Exact and heuristic approaches for the cycle hub location problem ⋮ The uncapacitated r‐allocation p‐hub center problem ⋮ An efficient model for the multiple allocation hub maximal covering problem ⋮ A non-triangular hub location problem ⋮ Allocation strategies in hub networks ⋮ Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU ⋮ Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm ⋮ An alternative approach to address uncertainty in hub location ⋮ Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ Location models for airline hubs behaving as \(M/D/c\) queues. ⋮ Preprocessing and cutting for multiple allocation hub location problems. ⋮ The planar hub location problem: a probabilistic clustering approach ⋮ The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems ⋮ An intermodal hub location problem for container distribution in Indonesia ⋮ A multiobjective hub-airport location problem for an airline network design ⋮ Benders decomposition for the uncapacitated multiple allocation hub location problem ⋮ A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method ⋮ Multi-period hub network design problems with modular capacities ⋮ Proprietor and customer costs in the incomplete hub location-routing network topology ⋮ An implicit enumeration algorithm for the hub interdiction median problem with fortification ⋮ A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem ⋮ Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation ⋮ Hub location-allocation in intermodal logistic networks ⋮ Network hub location problems: The state of the art ⋮ Capacitated single allocation hub location problem-A bi-criteria approach ⋮ Hub-and-spoke network design with congestion ⋮ Adapting polyhedral properties from facility to hub location problems ⋮ A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems ⋮ The capacitated single-allocation hub location problem revisited: a note on a classical formulation ⋮ Stochastic single-allocation hub location ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ Perspectives on modeling hub location problems ⋮ A review of transport market modeling using game-theoretic principles ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ HubLocator: An exact solution method for the multiple allocation hub location problem ⋮ Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery ⋮ Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system ⋮ Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem ⋮ A study of the quadratic semi-assignment polytope ⋮ Uncapacitated single and multiple allocation \(p\)-hub center problems ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion ⋮ On the Quadratic Programming Approach for Hub Location Problems ⋮ An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem ⋮ A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels ⋮ The tree of hubs location problem ⋮ The capacitated multiple allocation hub location problem: Formulations and algorithms ⋮ On the single-assignment \(p\)-hub center problem ⋮ Hub Location Problems: The Location of Interacting Facilities ⋮ Solving large single allocation \(p\)-hub problems with two or three hubs ⋮ Network cost minimization using threshold-based discounting ⋮ Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm ⋮ Metaheuristic applications on discrete facility location problems: a survey

Uses Software

Cites Work

This page was built for publication: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem