| Author: | Malandraki, C. Daskin, M. |
| Title: | The maximum benefit chinese postman problem and the maximum benefit travelling salesman problem |
| Journal: | European Journal of Operational Research
1993 : MAR 12, VOL. 65:2, p. 218-234 |
| Index terms: | INTEGER PROGRAMMING ROUTING PROBLEM BABY EQUIPMENT INDUSTRY CHINA |
| Language: | eng |
| Abstract: | This paper introduces the maximum benefit Chinese postman problem (MBCPP) and the maximum benefit traveling salesman problem (MBTSP). For the MBCPP a benefit is realized each time a link of a directed graph is traversed. The MBCPP relaxes the constraint of the Chinese postman problem that each link be traversed at least once and finds a tour of maximum total net benefit. For the MBTSP a benefit is derived when a node is visited and a cost is incurred when a link is traversed. Both problems are formulated as linear integer programming problems. |
SCIMA