Approximate solutions for the maximum benefit chinese postman problem

DOI10.1080/00207720500282292zbMath1126.90415OpenAlexW2091551618MaRDI QIDQ5426612

No author found.

Publication date: 13 November 2007

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207720500282292

zbMATH Keywords

algorithmsapproximate solutionsmaximum benefit Chinese postman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (11)

A branch-and-cut algorithm for the profitable windy rural postman problem ⋮ Approximate solutions for the capacitated arc routing problem ⋮ A branch-and-cut algorithm for the maximum benefit Chinese postman problem ⋮ The profitable close-enough arc routing problem ⋮ Hierarchical Chinese postman problem with fuzzy travel times ⋮ Coordinated road-network search route planning by a team of UAVs ⋮ The directed profitable rural postman problem with incompatibility constraints ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ City streets parking enforcement inspection decisions: the Chinese postman's perspective ⋮ Profitable mixed capacitated arc routing and related problems ⋮ The arc partitioning problem

Cites Work

• Approximate solutions for the capacitated arc routing problem
• The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
• Improved solutions for the Chinese postman problem on mixed networks
• Algorithms for the windy postman problem
• Transforming arc routing into node routing problems
• Solvable cases of the \(k\)-person Chinese postman problem
• Algorithms for the Chinese postman problem on mixed networks
• Algorithms for the rural postman problem
• An algorithm for the hierarchical Chinese postman problem
• Augment-insert algorithms for the capacitated arc routing problem
• Postman tour on a graph with precedence relation on arcs
• New lower bounds for the Capacitated Arc Routing Problem
• Capacitated arc routing problems
• Matching, Euler tours and the Chinese postman
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem

This page was built for publication: Approximate solutions for the maximum benefit chinese postman problem