Pages that link to "Item:Q811891"

The following pages link to Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm (Q811891):

Displaying 18 items.

• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing (Q264277) (← links)
• Exact approaches for static data segment allocation problem in an information network (Q337667) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• Single-allocation ordered median hub location problems (Q709204) (← links)
• Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution (Q727374) (← links)
• Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• A capacitated hub location problem under hose demand uncertainty (Q1651522) (← 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)
• Perspectives on modeling hub location problems (Q2029941) (← 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)
• Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
• Hub Location Problems: The Location of Interacting Facilities (Q5506727) (← links)
• The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation (Q6047913) (← 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)