A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
From MaRDI portal
Publication:2189879
DOI10.1016/j.ejor.2020.04.024zbMath1443.90327MaRDI QIDQ2189879
Yuan Yuan, Frédéric Semet, Diego Cattaruzza, Maxime Ogier
Publication date: 17 June 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.04.024
branch-and-cut; generalized traveling salesman problem; time-windows; delivery options; trunk delivery
90C35: Programming involving graphs or networks
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
Uses Software