A branch‐and‐cut algorithm for hub network design problems with profits
From MaRDI portal
Publication:6051584
DOI10.1002/nav.22035OpenAlexW3216466999MaRDI QIDQ6051584
Publication date: 20 October 2023
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.22035
branch-and-cut algorithmmixed integer linear programmingBenders decompositionhub network design problems with profits
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Cites Work
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- An improved Benders decomposition applied to a multi-layer network design problem
- The tree of hubs location problem
- Exact and heuristic approaches for the cycle hub location problem
- Exact solution of hub network design problems with profits
- An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion
- Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
- Hub Location as the Minimization of a Supermodular Set Function
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Solving the hub location problem in a star–star network
This page was built for publication: A branch‐and‐cut algorithm for hub network design problems with profits
