| 期刊論文| 1. | Kwan, M. K.(1962)。Graphic programming using odd or even points。Chinese Mathematics，1，273-277。   | | 2. | Lenstra, J. K.、Kan, A. H. G. R.(1981)。Complexity of vehicle routing and scheduling problems。Networks，11，221-227。 | | 3. | Papadiinitriou, C. H.(1976)。On the complexity of edge traversing。Journal of ACM，23，544-554。 | | 4. | Ball, M. O.、Magazine, M. L.(1988)。Sequencing of Insertions in Printed Circuit Board Assembly。Operations Research，36(2)，192-201。 | | 5. | Bertsekas, D. P.、Tseng, P.(1988)。The RELAX Codes for Linear Minimum Cost Network Flow Problems。Annals of Operations Research，13，125-192。 | | 6. | Bodin, L. D.(1975)。A Taxonomy Structure for Vehicle Routing and Scheduling Problems。Comput. J & Urban Soc，1，11-29。 | | 7. | (1991)。The Age of the Intelligent Super Map - The Smart Way to Manage Land, Facilities, and People。Business Week，1991(Jul.)，69-78。 | | 8. | Golden, B. L.、Wong, R. T.(1981)。Capacitated Arc Routing Problem。Networks，11，305-315。 | | 9. | Guan, M.(1984)。On the Windy Postman Problem。Discrete Applied Mathematics，9，41-46。 | | 10. | Kappauf, C. H.、Koehler, G. J.(1979)。The Mixed Postman Problem。Discrete Applied Mathematics，1，89-103。 | | 11. | McBride, R.(1982)。Controlling Left and U-turns in the Routing of Refuse Collection Vehicles。Computer & Operations Research，9(2)，145-152。 | | 12. | Minieka, E.(1979)。The Chinese Postman Problem for Mixed Networks。Management Science，25(7)，643-648。 | | 13. | Pearn, W. L.(1988)。New Lower Bounds for the Capacitated Arc Routing Problem。Networks，18，181-191。 | | 14. | Roy, S.、Rousseau, J. M.(1989)。The Capacitated Canadian Postman Problem。INFOR，27(1)，58-73。 | | 15. | Stern, H. L.、Dror, M.(1979)。Routing Electric Meter Readers。Computer & Operations Research，6，209-223。 | | 16. | Win, Z.(1989)。On the Windy Postman Problem on Eulerian Graphs。Mathematical Programming，44，97-112。 | | 17. | Zanakis, S. H.、Evans, J. R.(1981)。Heuristic Optimization: Why, When and How to Use It。Interfaces，11(5)，84-90。 | | 18. | Beltrami, E. J.、Bodin, L. D.(1974)。Networks and Vehicle Routing for Municipal Waste Collection。Network，4(1)，65-94。 | | 19. | Johnson, E. L.、Edmonds, J.(1973)。Matching, Euler tours and the Chinese Postman。Mathematical programming，5，88-124。 | | 20. | Bodin, L. D.、Kursh, S. J.(1978)。A computer-assisted system for the routing and scheduling of street sweepers。Operations Research，26(4)，525-537。 | | 21. | Frederickson, G. N.(1979)。Approximation algorithms for some postman problems。Journal of the Association for Computing Machinery，26，538-554。 | | 22. | Orloff, C. S.(1974)。A fundamental problem in vehicle routing。Networks，4(1)，35-64。 | 研究報告| 1. | Bodin, L. D.、Levy, L.(1989)。The Arc Partitioning Problem (計畫編號：MS/S 89-027)。College of Business and Management, University of Maryland。 | | 2. | Bodin, L. D.(1989)。20 Years of Routing and Scheduling (計畫編號：MS/S 89-026)。College of Business and Management, University of Maryland。 | | 3. | Bodin, L. D.、Fagan, G.、Welebny, R.、Greenberg, J.(1988)。The Design of a Computerized Sanitation Vehicle Routing and Scheduling System for the Town of Oyster Bay, New York (計畫編號：MS/S 88-005)。College of Business and Management, University of Maryland。 | | 4. | Bodin, L. D.、Golden, B.、Assad, A.、Ball, M.(1981)。The State of the Art in the Routing and Scheduling of Vehicles and Crews (計畫編號：UMTA-SKBD URT41-81-1)。College of Business and Management, University of Maryland。 | | 5. | Wunderlich, J.、Collette, M.、Levy, L.、Bodin, L. D.(1991)。Scheduling of Meter Readers for Southern California Gas Company。College of Business and Management, University of Maryland。 | | 6. | (1991)。TIGER: A Primer for Planners。American Planning Association。 | 學位論文| 1. | Su, S. I.(1992)。The General Postman Problems: Models and Algorithms(博士論文)。University of Maryland，College Park, MD.。 | 圖書| 1. | Ford, L. R.、Fulkerson, D. R.(1962)。Flows in Networks。NJ：Princeton University Press。 | | 2. | Harary, F.(1969)。Graph Theory。Reading, MA：Addison-Wesley。 | | 3. | Marshall, C. W.(1971)。Applied Graph Theory。NY：Wiley Interscience。 | | 4. | Garey, Michael R.、Johnson, David S.(1979)。Computers and Intractability: A Guide to the theory of NP-Completeness。W. H. Freeman and Company。 | 圖書論文| 1. | Levy, L.、Bodin, L. D.(1988)。Scheduling the Postal Carriers for the United States Postal Service: An Application of Arc Partitioning and Routing。Vehicle Routing: Methods and Studies。North-Holland：Elsevier Science Publishers。 | |