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):

Displaying 27 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)
• A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
• Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm (Q811891) (← links)
• New complexity results for the \(p\)-hub median problem (Q829182) (← links)
• Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems (Q1278346) (← 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)
• Solving large single allocation \(p\)-hub problems with two or three hubs (Q1595449) (← 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)
• A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← 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)
• Solving partitioning-hub location-routing problem using DCA (Q2358847) (← links)
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems (Q2444555) (← 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)
• An Exact Solution Approach Based on Shortest-Paths for <i>p</i>-Hub Median Problems (Q4427337) (← links)
• A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems (Q4685749) (← links)
• An efficient model for the multiple allocation hub maximal covering problem (Q6078427) (← links)
• A new formulation and branch-and-cut method for single-allocation hub location problems (Q6164619) (← links)