The target visitation arc routing problem
From MaRDI portal
Publication:2121609
Recommendations
Cites work
- A fundamental problem in vehicle routing
- A random keys based genetic algorithm for the target visitation problem
- A semidefinite optimization approach to the target visitation problem
- An algorithm for the hierarchical Chinese postman problem
- An algorithm for the Rural Postman problem on a directed graph
- Arc Routing
- scientific article; zbMATH DE number 5855014 (Why is no real title available?)
- Improvement Procedures for the Undirected Rural Postman Problem
- On the hierarchical Chinese postman problem with linear ordered classes
- Postman tour on a graph with precedence relation on arcs
- Solving the hierarchical Chinese postman problem as a rural postman problem.
- Solving the prize-collecting rural postman problem
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
- The hierarchical traveling salesman problem
- The linear ordering problem with clusters: a new partial ranking
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- The rural postman problem with deadline classes
Cited in
(4)
This page was built for publication: The target visitation arc routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2121609)