Benders decomposition algorithms for two variants of the single allocation hub location problem
From MaRDI portal
Publication:2005805
Recommendations
- Benders decomposition for large-scale uncapacitated hub location
- A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- An improved Benders decomposition algorithm for the tree of hubs location problem
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
Cites work
- scientific article; zbMATH DE number 949665 (Why is no real title available?)
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
- A Benders decomposition for hub location problems arising in public transport
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A compact linearisation of Euclidean single allocation hub location problems
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- A hub covering model for cargo delivery systems
- A hybrid heuristic for the uncapacitated hub location problem
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- A quadratic integer program for the location of interacting hub facilities
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Benders decomposition for large-scale uncapacitated hub location
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Benders decomposition with alternative multiple cuts for a multi-product closed-loop supply chain network design model
- Branch and price for large-scale capacitated hub location problems with single assignment
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Endogenous effects of hubbing on flow intensities
- Hub location problems with price sensitive demands
- Integer programming formulations of discrete hub location problems
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Multicommodity Distribution System Design by Benders Decomposition
- Multiple allocation hub-and-spoke network design under hub congestion
- Network hub location problems: The state of the art
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- On tabu search for the location of interacting hub facilities
- Partitioning procedures for solving mixed-variables programming problems
- Solution algorithms for the capacitated single allocation hub location problem
- Solution approaches to hub location problems
- Solving the uncapacitated hub location problem using genetic algorithms
- Spatial analysis of single allocation hub location problems
- Stochastic uncapacitated hub location
- The Benders decomposition algorithm: a literature review
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
Cited in
(21)- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Stochastic hub location problems with Bernoulli demands
- A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems
- Multiple allocation tree of hubs location problem for non-complete networks
- Benders decomposition for large-scale uncapacitated hub location
- Exact algorithms for the robust uncapacitated multiple allocation \(p\)-hub median problem
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
- Hub location with congestion and time-sensitive demand
- Machine learning augmented approaches for hub location problems
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Solving a capacitated hub location problem
- Exact method for production hub location
- Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem
- A new formulation and branch-and-cut method for single-allocation hub location problems
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- scientific article; zbMATH DE number 4020811 (Why is no real title available?)
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
- Multicommodity flows and Benders decomposition for restricted continuous location problems
- Single allocation hub location with heterogeneous economies of scale
This page was built for publication: Benders decomposition algorithms for two variants of the single allocation hub location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2005805)
