An algorithm for the design of mailbox collection routes in urban areas
- 1 August 1989
- journal article
- Published by Elsevier BV in Transportation Research Part B: Methodological
- Vol. 23 (4), 271-280
- https://doi.org/10.1016/0191-2615(89)90029-5
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Generalized travelling salesman problem through n sets of nodes: the asymmetrical caseDiscrete Applied Mathematics, 1987
- Configuration of physical distribution networksNetworks, 1986
- Bounds and Heuristics for Capacitated Routing ProblemsMathematics of Operations Research, 1985
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman ProblemManagement Science, 1980
- Routing and Scheduling of School Buses by ComputerTransportation Science, 1979
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954