Exact solution of the generalized routing problem through graph transformations
From MaRDI portal
Publication:4661094
DOI10.1057/palgrave.jors.2601590zbMath1095.90522OpenAlexW1999614211MaRDI QIDQ4661094
No author found.
Publication date: 4 April 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601590
traveling salesman problemrural postman problemgeneralized traveling salesman problemgeneralized routing problem
Related Items (10)
The mixed capacitated general routing problem under uncertainty ⋮ Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ Solving a generalized traveling salesperson problem with stochastic customers ⋮ Classification of de Bruijn-based labeled digraphs ⋮ Improved lower bounds and exact algorithm for the capacitated arc routing problem ⋮ Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows ⋮ An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ Arc routing in a node routing environment
Uses Software
This page was built for publication: Exact solution of the generalized routing problem through graph transformations
