Exact solution of the generalized routing problem through graph transformations
From MaRDI portal
Recommendations
- An efficient transformation of the generalized vehicle routing problem
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- A cutting plane algorithm for the general routing problem
- The general routing polyhedron: A unifying framework
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
Cited in
(16)- Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
- Classification of de Bruijn-based labeled digraphs
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- An efficient transformation of the generalized vehicle 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
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- Graphical-structure-based models for routing problems
- scientific article; zbMATH DE number 2016067 (Why is no real title available?)
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- A transformation for the mixed general routing problem with turn penalties
- Moving horizon capacitated arc routing problem
- Solving a generalized traveling salesperson problem with stochastic customers
This page was built for publication: Exact solution of the generalized routing problem through graph transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4661094)
