| 期刊論文| 1. | Bland, R. G.、Goldfarb, D.、Todd, M. J.(1981)。The ellipsoid method: a survey。Operations Research，29(6)，1039-1091。   | | 2. | Bodin, L. D.、Golden, B.(1981)。Classification in Vehicle Routing and Scheduling。Networks，11(2)，97-108。 | | 3. | Handler, G. Y.(1984)。The Absolute m-Center Problem on a Directed Network。Transportation Science，18(3)，300-303。 | | 4. | Fisher, M. L.、Jaikumar, R.(1981)。A Generalized Assignment Heuristic for Vehicle Routing。Networks，11，109-124。 | | 5. | Golden, B. L.、Magnanti, T. L.、Nguyen, H. Q.(1977)。Implementing Vehicle Routing Algorithms。Networks，7(2)，113-148。 | | 6. | Angier, N.(19841203)。Folding the Perfect Corner。Time，63。 | | 7. | Balas, E.、Christofides, N.(1981)。Restricted Lagrangean Approach to the Traveling Salesman Problem。Mathematical Programming，21，19-46。 | | 8. | Fitzsimmons, James A.(1973)。A Methodology for Emergency Ambulance Deployment。Management Science，19(6)，627-636。 | | 9. | Kolata, G.(1984)。A Fast Way to Solve Hard Problems。Science，225，1379-1380。 | | 10. | Minieka, E.(1983)。Pendant-Medians。Operations Research Letters，2(3)，104-106。 | | 11. | Parkar, R. G.、Rardin, R. L.(1983)。The Traveling Salesman Problem: An Update of Research。Naval Research Logistics Quarterly，30，69-96。 | | 12. | Daskin, M. S.(1983)。A maximum expected covering location model: Formulation, properties and heuristic solution。Transportation Science，17(1)，48-70。 | 會議論文| 1. | Fricker, J. D.、Tsay, H. S.(1983)。Resolving Conflicting Objectives in School Transportation。The TIMS/ORSA Joint National Meeting。Chicago。 | | 2. | Karmarkar, N.(1984)。A New Polynomial-Time Algorithm for Linear Programming。ACM Symposium on Theory of Computing (STOC)，304-311。 | | 3. | Perl, J.、Daskin, M. S.(1984)。Formulation and Solution of A Combined Warehouse Location/Vehicle Routing Model。The 63th Annual Meeting of the Transportation Research Board。 | | 4. | Srikar, B.、Srivastava, R.(1983)。Solution Methodology for the Location Routing Problem。The TIMS/ORSA Joint National Meeting。The Ohio State University。 | 研究報告| 1. | 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。 | 學位論文| 1. | Cullen, F. H.(1984)。Set Partitioning Based Heuristics for Interactive Routing(博士論文)。Georgia Institute of Technology。 | 圖書| 1. | 曾國雄(1983)。現代化儲運體系--理論與實務應用。鴻儒堂出版社。 延伸查詢 | | 2. | Christofides, N.(1975)。Graph theory an algorithmic approach。Academic Press。 | | 3. | Wong, R. T.(1983)。Recent Research on Location and Network Design Problems: An Annotated Bibliography。Krannert Graduate School of Management, Purdue University。 | | 4. | Mandle, C. E.(1979)。Applied Network Optimization。Academic Press。 | | 5. | Cohen, C.、Stein, J.(1978)。Multi purpose Optimization System: User's Guide Version 4。Vogelback Computing Center, Northwestern University。 | | 6. | Fricker, J. D.、Tsay, H. S.(1984)。A Warning on Breaking Subtours in Traveling Salesman Problem and Vehicle Routing Problems。Purdue University。 | | 7. | Gurevich, Y.、Stockmeyer, L.、Vishki, V.(1982)。Solving NP-Hard Problems on Graphs that are Almost Trees and an Application to Facility Location Problems。IBM Thomas J. Watson Research Center。 | | 8. | Perl, J.(1984)。The Multi-Depot Routing Allocation Problem。 | | 9. | Schrage, L. E.(1982)。User Manual for LINDO。The Scientific Press, University of Chicago。 | | 10. | Tansel, B. C.、Francis, R. L.、Lowe, T. J.(1981)。Location on Networks: A Survey。 | |