| Article ID: | iaor19991407 |
| Country: | Netherlands |
| Volume: | 82 |
| Issue: | 1 |
| Start Page Number: | 331 |
| End Page Number: | 342 |
| Publication Date: | Aug 1998 |
| Journal: | Annals of Operations Research |
| Authors: | Narula Subhash C., Boffey T. Brian |
| Keywords: | covering problems |
Research on covering has concentrated on problems where the facilities are small in relation to their cover sets and can justifiably be regarded as points. However, representation by a point is not reasonable for all facilities. In this paper, our objective is to consider path covering problems and study them with particular emphasis on multi-path models. We introduce a new problem, 2-MPSP, then formulate it and some of its variants. We also outline two solution approaches for solving the 2-MPSP problem.