论文信息 - The mixed postman problem

The mixed postman problem

Abstract The mixed postman problem is formulated as an integer linear program. A one to one correspondence is established between the extreme points of the linear programming polyhedron and prime assigned Euler networks. A prime assigned Euler network gives rise to a set of length equivalent prime postman tours. Some prime postman tour is optimal. Thus, it is sufficient to search the extreme points of the polyhedron to find an optimal postman tour.

Gary J. Koehler | Charles H. Kappauf | G. J. Koehler

[1] Frank Harary,et al. Graph Theory , 2016 .

[2] George B. Dantzig,et al. Generalized Upper Bounding Techniques , 1967, J. Comput. Syst. Sci..

[3] C. S. Orloff. A fundamental problem in vehicle routing , 1974, Networks.

[4] Christos H. Papadimitriou,et al. On the complexity of edge traversing , 1976, J. ACM.

[5] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[6] T. B. Boffey,et al. Applied Graph Theory , 1973 .

[7] Kurt Spielberg,et al. Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems , 1971, Oper. Res..

[8] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[9] Lawrence Bodin,et al. Networks and vehicle routing for municipal waste collection , 1974, Networks.

[10] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems , 1962 .

[11] Katta G. Murty. THE SYMMETRIC ASSIGNMENT PROBLEM , 1967 .