scientific article; zbMATH DE number 1947382

zbMath1019.90521MaRDI QIDQ4411346

Dino Ahr, Gerhard Reinelt

Publication date: 8 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610064.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

HeuristicsLower BoundsChinese Postman ProblemArc RoutingMin-Max Optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

On matchings, T‐joins, and arc routing in road networks ⋮ Hierarchical Chinese postman problem with fuzzy travel times ⋮ A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem ⋮ A metaheuristic for the min-max windy rural postman problem with K vehicles ⋮ OAR lib: an open source arc routing library ⋮ The min-max close-enough arc routing problem

This page was built for publication: