Pages that link to "Item:Q941531"

The following pages link to Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531):

Displaying 48 items.

• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing (Q264277) (← links)
• Hub location problems with price sensitive demands (Q264310) (← links)
• Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
• Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks (Q299776) (← links)
• Exact and heuristic algorithms for the design of hub networks with multiple lines (Q319742) (← links)
• Exact approaches for static data segment allocation problem in an information network (Q337667) (← links)
• A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion (Q408393) (← links)
• Allocation strategies in hub networks (Q418055) (← links)
• Stochastic uncapacitated hub location (Q421562) (← links)
• The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network (Q450150) (← links)
• The uncapacitated hub location problem in networks under decentralized management (Q547111) (← links)
• A fuzzy programming approach for dynamic virtual hub location problem (Q693418) (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
• Uncapacitated single and multiple allocation \(p\)-hub center problems (Q1013401) (← links)
• A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
• Benders decomposition applied to a robust multiple allocation incomplete hub location problem (Q1652441) (← links)
• \(p\)-hub median problem for non-complete networks (Q1652628) (← links)
• The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm (Q1681158) (← links)
• Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment (Q1717038) (← links)
• The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems (Q1725627) (← links)
• HUBBI: iterative network design for incomplete hub location problems (Q1725629) (← links)
• Exact solution of hub network design problems with profits (Q1754057) (← links)
• Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem (Q1754726) (← links)
• Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← links)
• A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
• Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure (Q2029964) (← links)
• A Benders decomposition algorithm for the maximum availability service facility location problem (Q2108127) (← links)
• Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
• Stochastic hub location problems with Bernoulli demands (Q2147142) (← links)
• A non-triangular hub location problem (Q2191284) (← 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 competitive hub location and pricing problem (Q2356192) (← links)
• A Benders' decomposition algorithm for optimizing distribution of perishable products considering postharvest biological behavior in agri-food supply chain: a case study of tomato (Q2358178) (← links)
• Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment (Q2397582) (← links)
• The planar hub location problem: a probabilistic clustering approach (Q2449351) (← links)
• A capacitated hub location problem in freight logistics multimodal networks (Q2629899) (← links)
• Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
• Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem (Q2672134) (← links)
• Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem (Q2673530) (← links)
• Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
• Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution (Q5058018) (← 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)
• A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services (Q6106599) (← links)
• Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm (Q6170664) (← links)