An improved Benders decomposition algorithm for the tree of hubs location problem
From MaRDI portal
Publication:2253556
DOI10.1016/j.ejor.2012.10.051zbMath1292.90176OpenAlexW2011018171MaRDI QIDQ2253556
Ricardo Saraiva de Camargo, Gilberto~jun. de Miranda, Elisangela Martins de Sá
Publication date: 27 July 2014
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.10.051
hub-and-spoke networksBenders decomposition methodBenders cuts selection schemetree of hubs location problem
Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (33)
Hub location problems with price sensitive demands ⋮ Spatial analysis of single allocation hub location problems ⋮ Upgrading nodes in tree-shaped hub location ⋮ Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks ⋮ Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach ⋮ Exact and heuristic algorithms for the design of hub networks with multiple lines ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ A two-level off-grid electric distribution problem on the continuous space ⋮ Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition ⋮ An exact algorithm for the modular hub location problem with single assignments ⋮ Routing and scheduling decisions in the hierarchical hub location problem ⋮ Benders decomposition applied to a robust multiple allocation incomplete hub location problem ⋮ \(p\)-hub median problem for non-complete networks ⋮ Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach ⋮ Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ A biased random-key genetic algorithm for the tree of hubs location problem ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem ⋮ The profit-oriented hub line location problem with elastic demand ⋮ Exact and heuristic approaches for the cycle hub location problem ⋮ Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach ⋮ A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment ⋮ The Benders decomposition algorithm: a literature review ⋮ Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem ⋮ Scheduling medical residents' training at university hospitals ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ Perspectives on modeling hub location problems ⋮ The capacitated directed cycle hub location and routing problem under congestion ⋮ A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming ⋮ Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
This page was built for publication: An improved Benders decomposition algorithm for the tree of hubs location problem
