Efficient algorithms for the uncapacitated single allocation p-hub median problem
From MaRDI portal
Publication:4228759
DOI10.1016/S0966-8349(96)00011-3zbMath0927.90065OpenAlexW1992790175WikidataQ126352166 ScholiaQ126352166MaRDI QIDQ4228759
Mohan Krishnamoorthy, Andreas T. Ernst
Publication date: 1 March 1999
Published in: Location Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0966-8349(96)00011-3
Related Items
Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing, Hub location problems with price sensitive demands, A tabu-search based heuristic for the hub covering problem over incomplete hub networks, Multiple allocation hub-and-spoke network design under hub congestion, Hub location for time definite transportation, A conditional \(p\)-hub location problem with attraction functions, Aggregation in hub location problems, A 2-phase algorithm for solving the single allocation \(p\)-hub center problem, New simple and efficient heuristics for the uncapacitated single allocation hub location problem, The stochastic \(p\)-hub center problem with service-level constraints, 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, Multi-product capacitated single-allocation hub location problems: formulations and inequalities, The hub location and pricing problem, Competitive multiple allocation hub location problem considering primary and backup routes, Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion, Exact and heuristic algorithms for the design of hub networks with multiple lines, Benders decomposition applied to profit maximizing hub location problem with incomplete hub network, Stochastic hub location problems with Bernoulli demands, Hub location under competition, A compact linearisation of Euclidean single allocation hub location problems, Lower bounding procedures for the single allocation hub location problem, The \(p\)-hub center allocation problem, Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks, GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem, A Stackelberg hub arc location model for a competitive environment, A branch-and-cut algorithm for the hub location and routing problem, A capacitated hub location problem under hose demand uncertainty, Scatter search for an uncapacitated \(p\)-hub median problem, A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem, A genetic algorithm for the uncapacitated single allocation planar hub location problem, Exact approaches for static data segment allocation problem in an information network, 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, Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems, 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, The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques, 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, Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem, A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem, General network design: a unified view of combined location and network design problems, A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem, A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion, Allocation strategies in hub networks, An improved algorithm for fixed-hub single allocation problems, Matheuristics for optimizing the network in German wagonload traffic, The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network, Preprocessing and cutting for multiple allocation hub location problems., Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem, The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems, HUBBI: iterative network design for incomplete hub location problems, An intermodal hub location problem for container distribution in Indonesia, Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods, Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations, 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, Developing equilibrium optimization methods for hub location problems, An implicit enumeration algorithm for the hub interdiction median problem with fortification, Multiple allocation hub interdiction and protection problems: model formulations and solution approaches, A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem, General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem, An improved linearization technique for a class of quadratic 0-1 programming problems, Hub location-allocation in intermodal logistic networks, Less is more: general variable neighborhood search for the capacitated modular hub location problem, Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths, LTL logistics networks with differentiated services, Benders decomposition algorithms for two variants of the single allocation hub location problem, Hub-and-spoke network design with congestion, Adapting polyhedral properties from facility to hub location problems, Solving the uncapacitated hub location problem using genetic algorithms, Facility location models for distribution system design, A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem, Single-allocation ordered median hub location problems, Oracle-based algorithms for binary two-stage robust optimization, The hub location problem with market selection, The capacitated single-allocation hub location problem revisited: a note on a classical formulation, Stochastic single-allocation hub location, Alternate solution approaches for competitive hub location problems, Hub interdiction problem variants: models and metaheuristic solution algorithms, Perspectives on modeling hub location problems, Flow shipment scheduling in an incomplete hub location-routing network design problem, A new formulation and an exact approach for the many-to-many hub location-routing problem, Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem, Allocation search methods for a generalized class of location-allocation problems, Uncapacitated single and multiple allocation \(p\)-hub center problems, Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion, Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems, Lagrangean relaxation for the capacitated hub location problem with single assignment, Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor, The capacitated multiple allocation hub location problem: Formulations and algorithms, On the single-assignment \(p\)-hub center problem, Location of hubs in a competitive environment, Solving large single allocation \(p\)-hub problems with two or three hubs, Network cost minimization using threshold-based discounting, Metaheuristic applications on discrete facility location problems: a survey, Spatial analysis of single allocation hub location problems, Endogenous effects of hubbing on flow intensities, Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach, Single Allocation Hub Location with Heterogeneous Economies of Scale, Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region, On the \(p\)-hub interdiction problem, A comparative study of different formulations for the capacitated discrete ordered median problem, The single allocation problem in the interacting three-hub network, Continuous maximal covering location problems with interconnected facilities, Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem, Hub location problem considering spoke links with incentive-dependent capacities, A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale, A branch‐and‐cut algorithm for hub network design problems with profits, The uncapacitated r‐allocation p‐hub center problem, On hub location problems in geographically flexible networks, An efficient model for the multiple allocation hub maximal covering problem, A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands, A non-triangular hub location problem, Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation, Machine learning augmented approaches for hub location problems, Multi-period single-allocation hub location-routing: models and heuristic solutions, Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU, The p-hub centre routing problem with emissions budget: formulation and solution procedure, A new formulation and branch-and-cut method for single-allocation hub location problems, An alternative approach to address uncertainty in hub location, A specialized branch \& bound \& cut for single-allocation ordered median hub location problems, The planar hub location problem: a probabilistic clustering approach, Alternate second order conic program reformulations for hub location under stochastic demand and congestion, Integrated hub location and flow processing schedule problem under renewable capacity constraint, LOCATING SUGAR CANE LOADING STATIONS UNDER VARIATIONS IN CANE SUPPLY, Star \(p\)-hub median problem with modular arc capacities, Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation, Network hub location problems: The state of the art, Capacitated single allocation hub location problem-A bi-criteria approach, Unmanned aerial vehicle hub-location and routing for monitoring geographic borders, A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems, HubLocator: An exact solution method for the multiple allocation hub location problem, On carriers collaboration in hub location problems, Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design, 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 bi-objective incomplete hub location-routing problem with flow shipment scheduling, On the Quadratic Programming Approach for Hub Location Problems, A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels, Hub Location Problems: The Location of Interacting Facilities, Combining very large scale and ILP based neighborhoods for a two-level location problem
