A new formulation and branch-and-cut method for single-allocation hub location problems
From MaRDI portal
Publication:6164619
DOI10.1016/j.cor.2023.106241OpenAlexW4363650182MaRDI QIDQ6164619
Inmaculada Espejo, Antonio M. Rodríguez-Chía, Juan M. Muñoz-Ocaña, Alfredo Marín
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106241
Related Items (1)
Cites Work
- Unnamed Item
- A compact linearisation of Euclidean single allocation hub location problems
- Lower bounding procedures for the single allocation hub location problem
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Allocation strategies in hub networks
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
- Adapting polyhedral properties from facility to hub location problems
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- The tree of hubs location problem
- 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
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- On the single-assignment \(p\)-hub center problem
- Solving large single allocation \(p\)-hub problems with two or three hubs
- A branch and cut algorithm for hub location problems with single assignment
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- Perspectives on modeling hub location problems
- Network hub location problems: The state of the art
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Projecting the flow variables for hub location problems
- A hub covering model for cargo delivery systems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
This page was built for publication: A new formulation and branch-and-cut method for single-allocation hub location problems
