Pages that link to "Item:Q2253556"

The following pages link to An improved Benders decomposition algorithm for the tree of hubs location problem (Q2253556):

Displaying 35 items.

• Hub location problems with price sensitive demands (Q264310) (← 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)
• Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition (Q320877) (← links)
• Upgrading nodes in tree-shaped hub location (Q1628119) (← links)
• An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
• Routing and scheduling decisions in the hierarchical hub location problem (Q1652350) (← 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)
• A biased random-key genetic algorithm for the tree of hubs location problem (Q1676487) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration (Q1711440) (← links)
• Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment (Q1717038) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem (Q1754726) (← links)
• Scheduling medical residents' training at university hospitals (Q1755256) (← links)
• A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming (Q1797769) (← links)
• Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
• Benders decomposition applied to profit maximizing hub location problem with incomplete hub network (Q2146970) (← links)
• A two-level off-grid electric distribution problem on the continuous space (Q2147125) (← links)
• Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach (Q2158031) (← links)
• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
• Spatial analysis of single allocation hub location problems (Q2358050) (← links)
• Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment (Q2397582) (← links)
• Multiple allocation tree of hubs location problem for non-complete networks (Q2669573) (← links)
• Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem (Q2673530) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q2980928) (← links)
• Solving the continuous multiple allocation<i>p</i>-hub median problem by the hyperbolic smoothing approach (Q3453424) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q4622772) (← links)
• The profit-oriented hub line location problem with elastic demand (Q6047874) (← links)
• Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach (Q6179230) (← links)
• Hub location with congestion and time-sensitive demand (Q6565427) (← links)
• A random-key GRASP for combinatorial optimization (Q6668154) (← links)