Benders decomposition for the uncapacitated multiple allocation hub location problem
From MaRDI portal
Publication:941531
DOI10.1016/j.cor.2006.07.002zbMath1180.90038OpenAlexW1988193614MaRDI QIDQ941531
Henrique Pacca Loureiro Luna, G. jun. Miranda, Ricardo S. de Camargo
Publication date: 1 September 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.07.002
Related Items (50)
Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ Hub location problems with price sensitive demands ⋮ A Benders' decomposition algorithm for optimizing distribution of perishable products considering postharvest biological behavior in agri-food supply chain: a case study of tomato ⋮ Multiple allocation hub-and-spoke network design under hub congestion ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks ⋮ A capacitated hub location problem in freight logistics multimodal networks ⋮ Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution ⋮ 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 ⋮ Stochastic hub location problems with Bernoulli demands ⋮ Benders Decomposition for Production Routing Under Demand Uncertainty ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ Exact approaches for static data segment allocation problem in an information network ⋮ Benders decomposition applied to a robust multiple allocation incomplete hub location problem ⋮ \(p\)-hub median problem for non-complete networks ⋮ Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment ⋮ Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm ⋮ Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem ⋮ Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem ⋮ A branch‐and‐cut algorithm for hub network design problems with profits ⋮ A non-triangular hub location problem ⋮ A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion ⋮ A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services ⋮ Allocation strategies in hub networks ⋮ Stochastic uncapacitated hub location ⋮ Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm ⋮ The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network ⋮ Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment ⋮ The planar hub location problem: a probabilistic clustering approach ⋮ The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ Alternate second order conic program reformulations for hub location under stochastic demand and congestion ⋮ Exact solution of hub network design problems with profits ⋮ Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ A fuzzy programming approach for dynamic virtual hub location problem ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ The uncapacitated hub location problem in networks under decentralized management ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems ⋮ Perspectives on modeling hub location problems ⋮ Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ Decomposition algorithms for solving the minimum weight maximal matching problem ⋮ Uncapacitated single and multiple allocation \(p\)-hub center problems ⋮ A Benders decomposition algorithm for the maximum availability service facility location problem ⋮ A competitive hub location and pricing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Heuristics for the p-hub location problem
- A quadratic integer program for the location of interacting hub facilities
- A multicut algorithm for two-stage stochastic linear programs
- Partitioning procedures for solving mixed-variables programming problems
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Exact sequential choice of locations in a network
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Optimal solution of cellular manufacturing system design: Bender's decomposition approach
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Preprocessing and cutting for multiple allocation hub location problems.
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- A comparison of optimal methods for local access uncapacitated network design
- Hub-and-spoke network design with congestion
- Enumeration and search procedures for a hub location problem with economies of scale
- A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
- An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
- Simultaneous Assignment of Locomotives and Cars to Passenger Trains
- Tailoring Benders decomposition for uncapacitated network design
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- Hub network design with single and multiple allocation: A computational study
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- A dual algorithm for the uncapacitated hub location problem
- Hub Location and the p-Hub Median Problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Lower Bounds for the Hub Location Problem
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- HubLocator: An exact solution method for the multiple allocation hub location problem
This page was built for publication: Benders decomposition for the uncapacitated multiple allocation hub location problem
