Chinese postman problem over 50 years

MaRDI QIDQ5399853zbMATH OpenFDO

Authors Jingzhen Gao, Bo Gao

Publication date 28 February 2014

zbMATH Keywords

computational complexityChinese postman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) History of operations research and mathematical programming (90-03)

Recommendations

• scientific article; zbMATH DE number 3880464
• Arc Routing Problems, Part I: The Chinese Postman Problem
• On the mixed Chinese postman problem
• An optimal algorithm for the mixed Chinese postman problem
• Finding postal carrier walk paths in mixed graphs

Cited in

(13)

• Chinese postman problem with priority nodes
• Chinese postman problem with priorities
• scientific article; zbMATH DE number 1568939 (Why is no real title available?)
• scientific article; zbMATH DE number 6612248 (Why is no real title available?)
• An integer programming approach for the rural postman problem with time dependent travel times
• Chinese postman problem with priorities (high costs of delays)
• A constraint programming approach to the Chinese postman problem with time windows
• scientific article; zbMATH DE number 4142070 (Why is no real title available?)
• The time-dependent rural postman problem: polyhedral results
• Erratum to: ``Approximating the length of Chinese postman tours
• Time-constrained Chinese postman problems
• Chinese postman problem on edge-colored multigraphs
• The Chinese deliveryman problem

This page was built for publication: Chinese postman problem over 50 years

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