✦ LIBER ✦

A Heuristic Algorithm for the Mixed Chinese Postman Problem

✍ Scribed by Kriangchai Yaoyuenyong; Peerayuth Charnsethikul; Vira Chankong

Book ID: 110401755
Publisher: Springer US
Year: 2002
Tongue: English
Weight: 336 KB
Volume: 3
Category: Article
ISSN: 1389-4420
DOI: 10.1023/a:1020915403051

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for the Chinese postman probl

Algorithms for the Chinese postman problem on mixed networks

✍ Wen Lea Pearn; C.M. Liu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 685 KB

Genetic algorithm for Chinese postman pr

Genetic algorithm for Chinese postman problems

✍ Jiang Hua; Kang Li-shan 📂 Article 📅 2003 🏛 Wuhan University 🌐 English ⚖ 245 KB

On the mixed Chinese postman problem

✍ T.K. Ralphs 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 289 KB

On the mixed Chinese postman problem

✍ T.K. Ralphs 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 289 KB

The mixed Chinese postman problem is a version of the well-known Chinese postman problem in which the underlying graph consists of both directed and undirected edges. We give an integer linear programming formulation for this problem and then show that the extreme points of its linear relaxation pol

A new algorithm for the directed chinese

A new algorithm for the directed chinese postman problem

✍ Lin Yaxiong; Zhao Yongchang 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 674 KB

A 3/2-Approximation Algorithm for the Mi

A 3/2-Approximation Algorithm for the Mixed Postman Problem

✍ Raghavachari, Balaji; Veerasamy, Jeyakesavan 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 269 KB