- BodinL., GoldenB., AssadA., and BallM. (1983). Routing and scheduling of vehicles and crews: the state of the art. Computers and Operations Research, 10, 62–212.
- ChandyK. and LoT. (1973). The capacitated minimum spanning tree. Networks, 3, 173–181.
- ChristofidesN., MingozziA., and TothP. (1981). Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical Programming, 20, 255–282.
- ChristofidesN., MingozziA., and TothP. (1979). The Vehicle Routing Problem. In Combinatorial Optimization, ChristofidesN., MingozziA., TothP., and SardiC. (eds.). John Wiley & Sons, Inc., New York, 315–338.
- DijkstraE. (1959). A note on two problems in connection with graphs. Numerische Mathematik, 1, 269–271.
- EdmondsJ. (1967). Optimum branchings. Journal of Research, National Bureau of Standards, 7IB, 233–340.
- GareyM. and JohnsonD. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
- GavishB. (1982). Topological design of centralized computer networks - Formulations and Algorithms. Networks, 12, 355–377.
- GavishB. (1983a). Formulations and algorithms for the capacitated minimal directed tree problem. Journal of the Association for Computing Machinery, 30, 118–132.
- GavishB. (1983b). Augmented lagrangean based algorithms for solving capacitated minimal spanning tree problems. Working Paper QM-8319, Graduate School of Management, University of Rochester, RochesterNew York.
- GoldenB., MagnantiT., and NguyenH. (1977) Implementing vehicle routing algorithms. Networks, 7, 113–148.
- HeldM. and KarpR., (1970). The traveling salesman problem and minimum spanning trees. Operations Research, 18, 1138–1162.
- HeldM. and KarpR., (1971). The traveling salesman problem and minimum spanning trees. Part II. Mathematical Programming, 1, 6–25.
- KershenbaumA. (1974). Computing capacitated minimal spanning trees efficiently. Networks 4, 299–310.
- KruskalJ. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7, 48–50.
- PrimR. (1957). Shortest connection networks and some generalizations. Bell Systems Technical Journal, 36, 1389–1401.
- ShoganA. (1983). Constructing a minimal-cost spanning tree subject to resource constraints and slow requirements. Networks, 13, 169–190.
- SolomonM. (1983). Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research (forthcoming).
- SolomonM. (1984a). On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints. Networks (forthcoming).
- SolomonM. (1984b). Vehicle Routing and Scheduling with Time Window Constraints Models and Algorithms. Ph.D. Dissertation, Department of Decision Sciences, The Wharton School, University of Pennsylvania, PhiladelphiaPennsylvania.
- 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