- BeardwoodJ., HaltonJ.H. and HammersleyJ.M. (1959). “The shortest path through many points”. Proceedings of the Cambridge Philosophical Society, 55, 299–327.
- CarréB. (1979). Graphs and Networks. Clarendon Press, Oxford.
- GarfinkelR. and NemhauserG.L. (1972). “Optimal set covering: a survey”. In Perspectives on Optimization: A Collection of Expository Articles (GeoffrionA.M., Ed.), Addison-Wesley, ReadingMassachusetts, 164–193.
- LabbéM. and LaporteG. (1986). “Maximizing user convenience and postal efficiency in post box location”. Belgian Journal of Operations Research, Statistics and Computer Science, 26, 21–35.
- LaporteG. (1988). “Location-routing problems”. In Vehicle Routing: Methods and Studies (GoldenB.L. and AssadA.A., Eds.), North-Holland, Amsterdam, 163–198.
- LaporteG., ChapleauS., LandryP.-É. and MercureH. (1989). “An algorithm for the design of mailbox collection routes in urban areas”. Transportation Research B, 23, 271–280.
- LemkeC., SalkinH.M. and SpielbergK. (1971). “Set covering by single branch enumeration with linear programming subproblems”. Operations Research, 19, 998–1022.
- RoyS. and RousseauJ.-M. (1989). “The capacitated Canadian postman problem”, INFOR, 27, 58–73.
- SalkinH.M. (1975). Integer Programming. Addison-Wesley, ReadingMassachusetts.
- Choose new content alerts to be informed about new research of interest to you
- Easy remote access to your institution's subscriptions on any device, from any location
- Save your searches and schedule alerts to send you new results
- Export your search results into a .csv file to support your research