Pages that link to "Item:Q1926700"

The following pages link to New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem (Q1926700):

Displayed 12 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 mixed integer linear model for clustering with variable selection (Q336929) ‎ (← links)
• Incremental optimization of hub and spoke network for the spokes' numbers and flow (Q1666325) ‎ (← links)
• A multiobjective hub-airport location problem for an airline network design (Q1737476) ‎ (← links)
• Perspectives on modeling hub location problems (Q2029941) ‎ (← links)
• The hub location and pricing problem (Q2140288) ‎ (← links)
• A non-triangular hub location problem (Q2191284) ‎ (← links)
• A competitive hub location and pricing problem (Q2356192) ‎ (← links)
• Hub location problem considering spoke links with incentive-dependent capacities (Q2676359) ‎ (← links)
• Hub Location as the Minimization of a Supermodular Set Function (Q2935299) ‎ (← links)
• A new formulation and branch-and-cut method for single-allocation hub location problems (Q6164619) ‎ (← links)