scientific article; zbMATH DE number 1947382

MaRDI QIDQ4411346zbMATH OpenFDO

Authors 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

zbMATH Keywords

Arc RoutingChinese Postman ProblemHeuristicsLower BoundsMin-Max Optimization

Mathematics Subject Classification ID

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

Recommendations

• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
• scientific article; zbMATH DE number 2134188
• A heuristic algorithm for the mixed Chinese postman problem
• Solvable cases of the \(k\)-person Chinese postman problem
• Improved solutions for the Chinese postman problem on mixed networks

Cited in

(12)

• Approximation algorithms for solving the heterogeneous Chinese postman problem
• The min-max close-enough arc routing problem
• Approximation algorithms for some min-max postmen cover problems
• OAR lib: an open source arc routing library
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
• scientific article; zbMATH DE number 2134188 (Why is no real title available?)
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
• Hierarchical Chinese postman problem with fuzzy travel times
• An improved heuristic algorithm for the maximum benefit Chinese postman problem
• On matchings, T‐joins, and arc routing in road networks
• Approximation algorithms for the restricted k-Chinese postman problems with penalties
• A metaheuristic for the min-max windy rural postman problem with K vehicles

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 Q4411346)