Pages that link to "Item:Q705504"

The following pages link to Adapting polyhedral properties from facility to hub location problems (Q705504):

Displaying 40 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)
• Exact approaches for static data segment allocation problem in an information network (Q337667) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• Stochastic uncapacitated hub location (Q421562) (← links)
• A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
• Single-allocation ordered median hub location problems (Q709204) (← 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)
• A conditional \(p\)-hub location problem with attraction functions (Q833528) (← links)
• Aggregation in hub location problems (Q833529) (← links)
• A study of the quadratic semi-assignment polytope (Q1013294) (← links)
• Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
• Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems (Q1026110) (← links)
• The tree of hubs location problem (Q1039782) (← 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)
• An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700) (← links)
• Incremental optimization of hub and spoke network for the spokes' numbers and flow (Q1666325) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← 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)
• Design of intermodal logistics networks with hub delays (Q1926780) (← links)
• The hub location problem with market selection (Q2027000) (← links)
• Alternate solution approaches for competitive hub location problems (Q2029306) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• Competitive multiple allocation hub location problem considering primary and backup routes (Q2140777) (← links)
• A non-triangular hub location problem (Q2191284) (← links)
• A competitive hub location and pricing problem (Q2356192) (← links)
• Solving a capacitated hub location problem (Q2384615) (← links)
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems (Q2444555) (← links)
• The planar hub location problem: a probabilistic clustering approach (Q2449351) (← links)
• Star \(p\)-hub median problem with modular arc capacities (Q2475857) (← links)
• Network hub location problems: The state of the art (Q2482813) (← links)
• A capacitated hub location problem in freight logistics multimodal networks (Q2629899) (← links)
• Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
• Solving the continuous multiple allocation<i>p</i>-hub median problem by the hyperbolic smoothing approach (Q3453424) (← links)
• Multiple allocation hub location with service level constraints for two shipment classes (Q6112611) (← links)
• A new formulation and branch-and-cut method for single-allocation hub location problems (Q6164619) (← links)