Pages that link to "Item:Q1291636"

The following pages link to Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem (Q1291636):

Displaying 50 items.

• Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing (Q264277) (← links)
• Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
• Hub location under competition (Q322435) (← links)
• GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem (Q336883) (← links)
• A two-level location-allocation problem in designing local access fiber optic networks (Q337111) (← links)
• Scatter search for an uncapacitated \(p\)-hub median problem (Q337508) (← links)
• A genetic algorithm for the uncapacitated single allocation planar hub location problem (Q337658) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network (Q450150) (← links)
• Multi-period hub network design problems with modular capacities (Q512995) (← links)
• A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem (Q526415) (← links)
• Hub location-allocation in intermodal logistic networks (Q531438) (← links)
• Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
• Hub interdiction problem variants: models and metaheuristic solution algorithms (Q723928) (← links)
• Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem (Q742303) (← links)
• Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm (Q811891) (← links)
• New formulations for the uncapacitated multiple allocation hub location problem (Q818098) (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
• Aggregation in hub location problems (Q833529) (← links)
• New simple and efficient heuristics for the uncapacitated single allocation hub location problem (Q833533) (← links)
• An exact solution procedure for a cluster hub location problem (Q859914) (← links)
• Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique (Q864018) (← links)
• On the enrouting protocol problem under uncertainty (Q877076) (← links)
• Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
• The capacitated single-allocation hub location problem revisited: a note on a classical formulation (Q992581) (← links)
• A study of the quadratic semi-assignment polytope (Q1013294) (← links)
• Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems (Q1278346) (← links)
• Location models for airline hubs behaving as \(M/D/c\) queues. (Q1423443) (← links)
• Preprocessing and cutting for multiple allocation hub location problems. (Q1427587) (← links)
• The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501) (← links)
• On the single-assignment \(p\)-hub center problem (Q1582051) (← links)
• Solving large single allocation \(p\)-hub problems with two or three hubs (Q1595449) (← links)
• Network cost minimization using threshold-based discounting (Q1600844) (← links)
• Upgrading nodes in tree-shaped hub location (Q1628119) (← links)
• Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion (Q1639271) (← links)
• A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
• An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
• Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521) (← links)
• \(p\)-hub median problem for non-complete networks (Q1652628) (← links)
• Reliable single allocation hub location problem under hub breakdowns (Q1652650) (← links)
• An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700) (← links)
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem (Q1677297) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
• The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems (Q1725627) (← links)
• An intermodal hub location problem for container distribution in Indonesia (Q1725631) (← links)
• A multiobjective hub-airport location problem for an airline network design (Q1737476) (← links)