| Article ID: | iaor2000434 |
| Country: | Brazil |
| Volume: | 17 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 28 |
| Publication Date: | Jun 1997 |
| Journal: | Pesquisa Operacional |
| Authors: | Boffey Brian |
| Keywords: | location, vehicle routing & scheduling |
In this paper, we review research on point location covering problems and their development from the Maximal Covering Location Problem. With this as a basis, a particular path problem (the Maximal Covering Shortest Path Problem) is chosen to serve as a prototype combined covering–location–routing problem and possible developments are suggested. Finally, we discuss possible avenues for further research.