Chinese postman problem with priority nodes

MaRDI QIDQ3070930zbMATH OpenFDO

Authors T. Kramberger, G. Štrubelj, Janez Žerovnik

Publication date 28 January 2011

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Chinese postman problem with priorities (high costs of delays)
• Chinese postman problem with priorities
• Chinese postman problem over 50 years
• scientific article; zbMATH DE number 3880464
• Arc Routing Problems, Part I: The Chinese Postman Problem

Cited in

(3)

• GIS technology as an environment for testing an advanced mathematical model for optimization of road maintenance
• Chinese postman problem with priorities (high costs of delays)
• Chinese postman problem with priorities

This page was built for publication: Chinese postman problem with priority nodes

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