A Priori Optimization
暂无分享,去创建一个
[1] Dimitris Bertsimas,et al. The dynamic traveling repairman problem , 1989 .
[2] David Simchi-Levi,et al. Minisum location of a traveling salesman , 1986, Networks.
[3] Patrick Jaillet,et al. Probabilistic Traveling Salesman Problems , 1985 .
[4] Samuel J. Raff,et al. Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..
[5] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[6] D. Bertsimas,et al. Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem , 1989 .
[7] Bruce L. Golden,et al. VEHICLE ROUTING: METHODS AND STUDIES , 1988 .
[8] Patrick Jaillet,et al. A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..
[9] Dimitris Bertsimas,et al. The probabilistic vehicle routing problem , 1988 .
[10] R. L. Collins,et al. A Minimal Technology Routing System for Meals on Wheels , 1983 .
[11] Loren K. Platzman,et al. An O(N log N) planar travelling salesman heuristic based on spacefilling curves , 1982, Oper. Res. Lett..
[12] Dimitris Bertsimas. Traveling Salesman Facility Location Problems , 1989, Transp. Sci..
[13] J. Steele. Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability , 1981 .
[14] Moshe Dror,et al. Stochastic vehicle routing with modified savings algorithm , 1986 .
[15] Bruce L. Golden,et al. Stochastic vehicle routing: A comprehensive approach , 1983 .
[16] Richard M. Karp,et al. Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..
[17] Alan M. Frieze,et al. On the value of a random minimum spanning tree problem , 1985, Discret. Appl. Math..
[18] David Simchi-Levi,et al. A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks , 1988, Oper. Res..
[19] Richard C. Larson,et al. Urban Operations Research , 1981 .
[20] Alexander H. G. Rinnooy Kan,et al. Bounds and Heuristics for Capacitated Routing Problems , 1985, Math. Oper. Res..
[21] F. Tillman. The Multiple Terminal Delivery Problem with Probabilistic Demands , 1969 .
[22] John J. Bartholdi,et al. Spacefilling curves and the planar travelling salesman problem , 1989, JACM.
[23] Richard M. Karp,et al. A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem , 1979, SIAM J. Comput..
[24] D. Simchi-Levi,et al. Heuristics and bounds for the travelling salesman location problem on the plane , 1987 .
[25] Gilbert Laporte,et al. Models and exact solutions for a class of stochastic location-routing problems , 1987 .
[26] N. Biggs. THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .
[27] D. Bertsimas. Probabilistic combinatorial optimization problems , 1988 .
[28] Dimitris Bertsimas,et al. The probabilistic minimum spanning tree problem , 1990, Networks.
[29] David Simchi-Levi,et al. Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers , 1988, Transp. Sci..
[30] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[31] J. Michael Steele,et al. On Frieze's χ(3) limit for lengths of minimal spanning trees , 1987, Discret. Appl. Math..
[32] J A White,et al. TRAVELING SALESMAN LOCATION PROBLEM , 1976 .
[33] Dimitris Bertsimas,et al. A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..
[34] J. Beardwood,et al. The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.