Pages that link to "Item:Q1013401"

The following pages link to Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401):

Displaying 50 items.

• Hub location under competition (Q322435) (← links)
• A two-level location-allocation problem in designing local access fiber optic networks (Q337111) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• Developing equilibrium optimization methods for hub location problems (Q521701) (← links)
• A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem (Q526415) (← links)
• General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem (Q526421) (← links)
• Facility location models for distribution system design (Q707128) (← 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)
• New formulations for the uncapacitated multiple allocation hub location problem (Q818098) (← links)
• New complexity results for the \(p\)-hub median problem (Q829182) (← links)
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks (Q833521) (← links)
• Hub location for time definite transportation (Q833526) (← links)
• Aggregation in hub location problems (Q833529) (← links)
• A 2-phase algorithm for solving the single allocation \(p\)-hub center problem (Q833530) (← links)
• The stochastic \(p\)-hub center problem with service-level constraints (Q833535) (← links)
• The \(p\)-hub center allocation problem (Q852943) (← links)
• Aggregation error for location models: Survey and analysis (Q1026594) (← links)
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems (Q1278346) (← 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)
• On the single-assignment \(p\)-hub center problem (Q1582051) (← links)
• Optimizing fuzzy \( p\)-hub center problem with generalized value-at-risk criterion (Q1632000) (← links)
• Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
• Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount (Q1719220) (← 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)
• Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations (Q1733092) (← links)
• Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths (Q1761222) (← links)
• LTL logistics networks with differentiated services (Q1761236) (← links)
• New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem (Q1926700) (← links)
• An on-demand same-day delivery service using direct peer-to-peer transshipment strategies (Q2005834) (← links)
• The hub location problem with market selection (Q2027000) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• Improved hardness and approximation results for single allocation hub location (Q2039648) (← links)
• Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion (Q2052283) (← links)
• An efficient heuristic for a hub location routing problem (Q2070128) (← links)
• On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality (Q2149101) (← links)
• A non-triangular hub location problem (Q2191284) (← links)
• Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs (Q2285135) (← links)
• Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem (Q2289952) (← links)
• Modeling congestion and service time in hub location problems (Q2295119) (← links)
• Approximation algorithms for median hub location problems (Q2424817) (← links)
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems (Q2444555) (← links)
• Network hub location problems: The state of the art (Q2482813) (← links)
• Improved hardness and approximation results for single allocation hub location problems (Q2661760) (← links)
• Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs (Q2817864) (← links)
• An Exact Solution Approach Based on Shortest-Paths for <i>p</i>-Hub Median Problems (Q4427337) (← links)
• The single allocation problem in the interacting three-hub network (Q4944738) (← links)
• Allocating nodes to hubs for minimizing the hubs processing resources: A case study (Q5242266) (← links)