Pages that link to "Item:Q4427337"

The following pages link to An Exact Solution Approach Based on Shortest-Paths for <i>p</i>-Hub Median Problems (Q4427337):

Displaying 50 items.

• 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)
• A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
• Exact approaches for static data segment allocation problem in an information network (Q337667) (← 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)
• A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• Stochastic air freight hub location and flight routes planning (Q733484) (← 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)
• New complexity results for the \(p\)-hub median problem (Q829182) (← links)
• Aggregation in hub location problems (Q833529) (← links)
• A 2-phase algorithm for solving the single allocation \(p\)-hub center problem (Q833530) (← links)
• An exact solution procedure for a cluster hub location problem (Q859914) (← links)
• Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem (Q879279) (← links)
• Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem (Q976311) (← links)
• Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem (Q1291636) (← links)
• Efficient solution procedure and reduced size formulations for \(p\)-hub location problems (Q1296008) (← links)
• Integer programming formulations of discrete hub location problems (Q1317166) (← links)
• Preprocessing and cutting for multiple allocation hub location problems. (Q1427587) (← links)
• The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501) (← links)
• Solving large single allocation \(p\)-hub problems with two or three hubs (Q1595449) (← 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)
• \(p\)-hub median problem for non-complete networks (Q1652628) (← links)
• Incremental optimization of hub and spoke network for the spokes' numbers and flow (Q1666325) (← 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)
• Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← 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)
• Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods (Q1730620) (← links)
• A multiobjective hub-airport location problem for an airline network design (Q1737476) (← links)
• Exact solution of hub network design problems with profits (Q1754057) (← links)
• Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths (Q1761222) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem (Q1926700) (← links)
• Location of facility based on simulated annealing and ``ZKW'' algorithms (Q1992773) (← links)
• Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• The hub location and pricing problem (Q2140288) (← links)
• Alternate second order conic program reformulations for hub location under stochastic demand and congestion (Q2241568) (← links)
• Spatial analysis of single allocation hub location problems (Q2358050) (← links)
• An approximation algorithm for the \(p\)-hub median problem (Q2413170) (← links)
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems (Q2444555) (← links)
• Star \(p\)-hub median problem with modular arc capacities (Q2475857) (← links)