Exact solution of the generalized routing problem through graph transformations
From MaRDI portal
Publication:4661094
DOI10.1057/palgrave.jors.2601590zbMath1095.90522MaRDI 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 problem; rural postman problem; generalized traveling salesman problem; generalized routing problem
90B20: Traffic problems in operations research
Related Items
Two-phase branch-and-cut for the mixed capacitated general routing problem, Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm, Solving a generalized traveling salesperson problem with stochastic customers, Improved lower bounds and exact algorithm for the capacitated arc routing problem, An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation, Arc routing in a node routing environment, The mixed capacitated general routing problem under uncertainty, Recent results on Arc Routing Problems: An annotated bibliography
Uses Software