Opening book details…
Can I read An optimal algorithm for the mixed Chinese postman problem on EtoBox?
An optimal algorithm for the mixed Chinese postman problem by Nobert, Yves; Picard, Jean-Claude is a Computer Science article available to read on EtoBox.
What is An optimal algorithm for the mixed Chinese postman problem about?
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, we 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. Detailed computational results are presented. 0 7996 John Wiley & Sons, Inc.
Who reads An optimal algorithm for the mixed Chinese postman problem?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Nobert, Yves; Picard, Jean-Claude
- Publisher
- John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0028-3045)
- Published
- 1996
- Language
- EN
- Field
- Computer Science (Physical Sciences)