On the Maximum Benefit Chinese Postman Problem
โ Scribed by W.L. Pearn; K.H. Wang
- Book ID
- 114230788
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 111 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0305-0483
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
The Rural Postman Problem (RPP), on an undirected network, is a classic edge-routing problem. The Crossing Postman Problem is a generalization which is introduced here. Results are presented on the structure of optimal solutions to both problems. A new formulation for RPP, based on these results, is