Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties

DOI10.1007/s11590-023-01992-zOpenAlexW4324046710MaRDI QIDQ6181377

Pengxiang Pan, Hong-tao Zhu

Publication date: 22 January 2024

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-023-01992-z

zbMATH Keywords

traveling salesmanapproximation algorithmrestrictedpenaltiesChinese postman

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• A note on the prize collecting traveling salesman problem
• Solving the prize-collecting rural postman problem
• An extension of Christofides heuristic to the k-person travelling salesman problem
• Solvable cases of the \(k\)-person Chinese postman problem
• Privatized rural postman problems
• The restricted Chinese postman problems with penalties
• The prize collecting traveling salesman problem
• The Capacitated Arc Routing Problem: Lower bounds
• Matching, Euler tours and the Chinese postman
• A General Approximation Technique for Constrained Forest Problems
• Combinatorial optimization. Theory and algorithms
• A (slightly) improved approximation algorithm for metric TSP

This page was built for publication: Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties