๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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