Approximate solutions for the maximum benefit chinese postman problem

DOI10.1080/00207720500282292MaRDI QIDQ5426612zbMATH OpenOpenAlexFDO

Authors

Publication date 13 November 2007

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (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)

Recommendations

• The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem
• An improved heuristic algorithm for the maximum benefit Chinese postman problem
• An optimal algorithm for the mixed Chinese postman problem
• An approximation algorithm for solving the heterogeneous Chinese postman problem
• Approximation algorithms for solving the heterogeneous Chinese postman problem
• scientific article; zbMATH DE number 4211828
• A Note on K-Best Solutions to the Chinese Postman Problem
• Publication:4944300
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases

Cites work

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

Cited in

(17)

• Approximate solutions for the capacitated arc routing problem
• The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
• The directed profitable rural postman problem with incompatibility constraints
• An approximation algorithm for solving the heterogeneous Chinese postman problem
• Approximating the length of Chinese postman tours
• Profitable mixed capacitated arc routing and related problems
• The profitable close-enough arc routing problem
• Recent results on arc routing problems: an annotated bibliography
• A branch-and-cut algorithm for the profitable windy rural postman problem
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem
• The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game
• Hierarchical Chinese postman problem with fuzzy travel times
• An improved heuristic algorithm for the maximum benefit Chinese postman problem
• Coordinated road-network search route planning by a team of UAVs
• City streets parking enforcement inspection decisions: the Chinese postman's perspective
• Uncertain multi-objective Chinese postman problem
• The arc partitioning problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426612)