scientific article; zbMATH DE number 1568940
From MaRDI portal
Publication:4762467
Recommendations
- The complexity of arc routing problems
- scientific article; zbMATH DE number 5021774
- The generalized arc routing problem
- scientific article; zbMATH DE number 1568938
- scientific article; zbMATH DE number 2156293
- On the general routing polytope
- scientific article; zbMATH DE number 1520350
- scientific article; zbMATH DE number 1568941
- Arc Routing
- Polyhedral results for a vehicle routing problem
Cited in
(16)- scientific article; zbMATH DE number 1568937 (Why is no real title available?)
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- scientific article; zbMATH DE number 5021774 (Why is no real title available?)
- scientific article; zbMATH DE number 1520350 (Why is no real title available?)
- A decade of capacitated arc routing
- Computing finest mincut partitions of a graph and application to routing problems
- Lower bounds for the mixed capacitated arc routing problem
- A GRASP heuristic for the mixed Chinese postman problem
- On a conjecture related to geometric routing
- A cutting plane algorithm for the capacitated arc routing problem
- Undirected postman problems with zigzagging option: a cutting-plane approach
- The complexity of arc routing problems
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- The capacitated arc routing problem with refill points
- On the general routing polytope
- Projection results for vehicle routing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4762467)