Pages that link to "Item:Q1027993"

The following pages link to Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993):

Displaying 30 items.

• Multi-product capacitated single-allocation hub location problems: formulations and inequalities (Q301056) (← links)
• Lower bounding procedures for the single allocation hub location problem (Q325391) (← links)
• A Lagrangian relaxation approach for expansion of a highway network (Q512983) (← links)
• Hub and spoke network design with single-assignment, capacity decisions and balancing requirements (Q651672) (← links)
• A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
• Single-allocation ordered median hub location problems (Q709204) (← links)
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing (Q750288) (← links)
• Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
• The capacitated single-allocation hub location problem revisited: a note on a classical formulation (Q992581) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem (Q1342649) (← 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)
• HUBBI: iterative network design for incomplete hub location problems (Q1725629) (← links)
• Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods (Q1730620) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Proprietor and customer costs in the incomplete hub location-routing network topology (Q1991436) (← links)
• Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← links)
• The hub location problem with market selection (Q2027000) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor (Q2076863) (← links)
• Stochastic hub location problems with Bernoulli demands (Q2147142) (← links)
• Alternate second order conic program reformulations for hub location under stochastic demand and congestion (Q2241568) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems (Q2444555) (← links)
• Branch and price for large-scale capacitated hub location problems with single assignment (Q2899101) (← links)
• Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds (Q3703812) (← links)
• Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem (Q3813577) (← links)
• Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation (Q6106564) (← links)
• Machine learning augmented approaches for hub location problems (Q6109558) (← links)