✦ LIBER ✦

Arc Routing Problems, Part I: The Chinese Postman Problem

✍ Scribed by H. A. Eiselt, Michel Gendreau and Gilbert Laporte

Book ID: 111653146
Publisher: INFORMS
Year: 1995
Tongue: English
Weight: 565 KB
Volume: 43
Category: Article
ISSN: 0030-364X
DOI: 10.2307/171832

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Arc Routing Problems, Part II: The Rural

Arc Routing Problems, Part II: The Rural Postman Problem

✍ H. A. Eiselt, Michel Gendreau and Gilbert Laporte 📂 Article 📅 1995 🏛 INFORMS 🌐 English ⚖ 639 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

On the Maximum Benefit Chinese Postman P

On the Maximum Benefit Chinese Postman Problem

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

Cost allocation in the Chinese postman p

Cost allocation in the Chinese postman problem

✍ Herbert Hamers; Peter Borm; Robert van de Leensel; Stef Tijs 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 169 KB

A Heuristic Algorithm for the Mixed Chin

A Heuristic Algorithm for the Mixed Chinese Postman Problem

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