The restricted Chinese postman problems with penalties

DOI10.1016/j.orl.2021.10.002OpenAlexW3207929187MaRDI QIDQ2670442

Hong-tao Zhu, Pengxiang Pan

Publication date: 11 March 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2021.10.002

zbMATH Keywords

combinatorial optimizationapproximation algorithmsChinese postman problemrestrictedpenalties

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

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

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A note on the prize collecting traveling salesman problem
• Solving the prize-collecting rural postman problem
• Privatized rural postman problems
• Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
• The prize collecting traveling salesman problem
• Matching, Euler tours and the Chinese postman
• A General Approximation Technique for Constrained Forest Problems
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: The restricted Chinese postman problems with penalties