Benders decomposition algorithms for two variants of the single allocation hub location problem
From MaRDI portal
Publication:2005805
DOI10.1007/s11067-018-9424-zOpenAlexW2896366659MaRDI QIDQ2005805
Nader Ghaffari-Nasab, Bahar Yetis Kara
Publication date: 8 October 2020
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/52990
Related Items (6)
Stochastic hub location problems with Bernoulli demands ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem ⋮ Machine learning augmented approaches for hub location problems ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
Cites Work
- Hub location problems with price sensitive demands
- A compact linearisation of Euclidean single allocation hub location problems
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Stochastic uncapacitated hub location
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Solving the uncapacitated hub location problem using genetic algorithms
- Multiple allocation hub-and-spoke network design under hub congestion
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- A quadratic integer program for the location of interacting hub facilities
- 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
- 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
- Solution approaches to hub location problems
- A hybrid heuristic for the uncapacitated hub location problem
- The Benders decomposition algorithm: a literature review
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- An improved Benders decomposition algorithm for the tree of hubs location problem
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
- Spatial analysis of single allocation hub location problems
- Endogenous effects of hubbing on flow intensities
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- Network hub location problems: The state of the art
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
- A hub covering model for cargo delivery systems
- Benders decomposition with alternative multiple cuts for a multi-product closed-loop supply chain network design model
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- A Benders Decomposition for Hub Location Problems Arising in Public Transport
- Unnamed Item
This page was built for publication: Benders decomposition algorithms for two variants of the single allocation hub location problem
