✦ LIBER ✦

Approximate solutions for the maximum benefit chinese postman problem

✍ Scribed by Pearn, W. L.; Chiu, W. C.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Maximum Benefit Chinese Postman P

✍ W.L. Pearn; K.H. Wang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 111 KB

A branch-and-cut algorithm for the maxim

✍ CorberÃ¡n, Ãngel; Plana, Isaac; RodrÃguez-ChÃa, Antonio M.; Sanchis, JosÃ© M. 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 467 KB

A Note on K -Best Solutions to the Chine

✍ Saruwatari, Yasufumi; Matsui, Tomomi 📂 Article 📅 1993 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 949 KB

A Heuristic Algorithm for the Mixed Chin

✍ Kriangchai Yaoyuenyong; Peerayuth Charnsethikul; Vira Chankong 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 336 KB

A new algorithm for the directed chinese

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

Algorithms for the Chinese postman probl

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