Pages that link to "Item:Q2899101"

The following pages link to Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment (Q2899101):

Displaying 28 items.

• Multi-product capacitated single-allocation hub location problems: formulations and inequalities (Q301056) (← links)
• A Stackelberg hub arc location model for a competitive environment (Q337007) (← links)
• A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem (Q398914) (← links)
• An \(M/M/c\) queue model for hub covering location problem (Q409968) (← links)
• A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
• Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem (Q742303) (← links)
• Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion (Q1639271) (← links)
• An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
• Reliable single allocation hub location problem under hub breakdowns (Q1652650) (← links)
• HUBBI: iterative network design for incomplete hub location problems (Q1725629) (← links)
• Exact solution of hub network design problems with profits (Q1754057) (← links)
• A look at the past and present of optimization - an editorial (Q1926685) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← links)
• Stochastic single-allocation hub location (Q2029287) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• Alternate second order conic program reformulations for hub location under stochastic demand and congestion (Q2241568) (← links)
• On carriers collaboration in hub location problems (Q2286966) (← links)
• A competitive hub location and pricing problem (Q2356192) (← links)
• Spatial analysis of single allocation hub location problems (Q2358050) (← links)
• Task assignment in tree-like hierarchical structures (Q2410113) (← links)
• A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels (Q2835680) (← links)
• Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
• A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
• Single Allocation Hub Location with Heterogeneous Economies of Scale (Q5080641) (← links)
• Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region (Q5085994) (← links)
• A branch‐and‐cut algorithm for hub network design problems with profits (Q6051584) (← links)
• Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation (Q6106564) (← links)