AN OPTIMAL ALGORITHM FOR THE MIXED CHINESE POSTMAN PROBLEM

The Chinese Postman problem is well solved when the original graph contains only arcs or only edges. The mixed chinese Postman Problem (MCPP) is however NP-complete and very few papers have been devoted to this problem. In this paper, the authors present a new integer programming model and a new optimal algorithm for the MCPP. The simplex method is used iteratively to obtain sharp lower bounds by solving successive relaxations of this model. Optimality is achieved by using Gomory cuts, blossom inequalities and balanced set constraints. Elaborate computer results are presented. (A)

• Corporate Authors:

  CENTRE DE RECHERCHE SUR LES TRANSPORTS. UNIVERSITE DE MONTREAL

  C.P. 6128, SUCCURSALE A
  MONTREAL, QUEBEC  Canada  H3C 3J7
• Authors:
  • Nobert, Y
• Publication Date: 1991

Language

• English

Media Info

• Features: References;
• Pagination: 54 p.
• Serial:
  • CENTRE DE RECHERCHE SUR LES TRANSPORTS PUBLICATION
  • Issue Number: 799
  • Publisher: Universite de Montreal

Subject/Index Terms

• TRT Terms: Calculation; Mathematical models; Methodology; Optimization; Theory
• Uncontrolled Terms: Optimum
• ITRD Terms: 6464: Calculation; 6473: Mathematical model; 9102: Method; 9078: Theory

Filing Info

• Accession Number: 00674392
• Record Type: Publication
• Source Agency: Transportation Association of Canada (TAC)
• Files: ITRD
• Created Date: Mar 8 1995 12:00AM