scientific article

zbMATH Open0758.90073MaRDI QIDQ4025748

Shouhuai Gu

Publication date: 18 February 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

shortest pathbranch-and-boundassignmentoptimum matchingChinese-postman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

An approximation algorithm for solving the heterogeneous Chinese postman problem ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Approximating the length of Chinese postman tours

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A new algorithm for the directed Chinese postman problem 👍 👎
• On the mixed Chinese postman problem 👍 👎
• A heuristic algorithm for the mixed Chinese postman problem 👍 👎
• Algorithms for the Chinese postman problem on mixed networks 👍 👎
• An algorithm for the hierarchical Chinese postman problem 👍 👎
• An approximation algorithm for solving the heterogeneous Chinese postman problem 👍 👎
• An optimal algorithm for the mixed Chinese postman problem 👍 👎

This page was built for publication:

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