Local Optimization and the Traveling Salesman Problem
暂无分享,去创建一个
[1] L. Darrell Whitley,et al. Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.
[2] Aart Joppe,et al. A neural network for solving the travelling salesman problem on the basis of city adjacency in the tour , 1990, 1990 IJCNN International Joint Conference on Neural Networks.
[3] G. L. Nemhauser,et al. Tight bounds for christofides' traveling salesman heuristic , 1978, Math. Program..
[4] Dirk Van Gucht,et al. Incorporating Heuristic Information into Genetic Search , 1987, International Conference on Genetic Algorithms.
[5] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[6] Jimmy Kwok-Ching Lam,et al. An efficient simulated annealing schedule , 1988 .
[7] A. Bagchi,et al. Neighborhood search algorithms for finding optimal traveling salesman tours must be inefficient , 1973, STOC.
[8] I ScottKirkpatrick. Optimization by Simulated Annealing: Quantitative Studies , 1984 .
[9] Catherine A. Schevon,et al. Optimization by simulated annealing: An experimental evaluation , 1984 .
[10] Carsten Peterson,et al. Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem , 1990, Neural Computation.
[11] Schloss Birlinghoven. Evolution in Time and Space -the Parallel Genetic Algorithm , 1991 .
[12] Harold Neil Gabow,et al. Implementation of algorithms for maximum matching on nonbipartite graphs , 1973 .
[13] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[14] Hoon Liong Ong,et al. Worst-case analysis of two travelling salesman heuristics , 1984 .
[15] B. Fritzke,et al. FLEXMAP-a neural network for the traveling salesman problem with linear time and space complexity , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.
[16] Teuvo Kohonen,et al. Self-Organization and Associative Memory , 1988 .
[17] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[18] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.
[19] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[20] Michel X. Goemans,et al. Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem , 1991, Math. Oper. Res..
[21] Laura I. Burke,et al. The guilty net for the traveling salesman problem , 1992, Comput. Oper. Res..
[22] David M Stein. SCHEDULING DIAL-A-RIDE TRANSPORTATION SYSTEMS: AN ASYMPTOTIC APPROACH , 1977 .
[23] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[24] DAVID JOHNSON,et al. More approaches to the travelling salesman guide , 1987, Nature.
[25] Sanjit K. Mitra,et al. Alternative networks for solving the traveling salesman problem and the list-matching problem , 1988, IEEE 1988 International Conference on Neural Networks.
[26] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[27] Gerhard Reinelt,et al. Fast Heuristics for Large Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..
[28] Kenneth Steiglitz,et al. Some Examples of Difficult Traveling Salesman Problems , 1978, Oper. Res..
[29] Sartaj Sahni,et al. Experiments with Simulated Annealing , 1985, 22nd ACM/IEEE Design Automation Conference.
[30] Dirk Van Gucht,et al. Parallel Genetic Algorithms Applied to the Traveling Salesman Problem , 1991, SIAM J. Optim..
[31] E. Bonomi,et al. The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm , 1984 .
[32] R. E. Bellman,et al. Review: Eugene L. Lawler, Combinatorial optimization: networks and matroids , 1978 .
[33] D. Mitra,et al. Convergence and finite-time behavior of simulated annealing , 1985, 1985 24th IEEE Conference on Decision and Control.
[34] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[35] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..
[36] Martina Gorges-Schleuter,et al. ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.
[37] Richard M. Karp,et al. Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..
[38] Gerhard W. Dueck,et al. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .
[39] M. Troyon. Quelques heuristiques et résultats asymptotiques pour trois problèmes d'optimisation combinatoire , 1988 .
[40] Edward W. Felten,et al. Large-step markov chains for the TSP incorporating local search heuristics , 1992, Oper. Res. Lett..
[41] E. Baum. Towards practical `neural' computation for combinatorial optimization problems , 1987 .
[42] Ehl Emile Aarts,et al. Simulated annealing : an introduction , 1989 .
[43] Giovanni Rinaldi,et al. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..
[44] Robert E. Tarjan,et al. Faster scaling algorithms for general graph matching problems , 1991, JACM.
[45] B. Schnetzler. Des opérateurs d'échange et une méthode de relaxation pour le problème du voyageur de commerce , 1992 .
[46] Reiko Tanese,et al. Distributed Genetic Algorithms , 1989, ICGA.
[47] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[48] P. V. Laarhoven,et al. A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem , 1988 .
[49] Bruce E. Hajek,et al. The time complexity of maximum matching by simulated annealing , 1988, JACM.
[50] John D. Litke,et al. An improved solution to the traveling salesman problem with thousands of nodes , 1984, CACM.
[51] Miroslaw Malek,et al. Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem , 1990 .
[52] John J. Bartholdi,et al. Spacefilling curves and the planar travelling salesman problem , 1989, JACM.
[53] Christos H. Papadimitriou,et al. On Two Geometric Problems Related to the Traveling Salesman Problem , 1984, J. Algorithms.
[54] G. Croes. A Method for Solving Traveling-Salesman Problems , 1958 .
[55] J. Michael Steele,et al. Complete Convergence of Short Paths and Karp's Algorithm for the TSP , 1981, Math. Oper. Res..
[56] M. Padberg,et al. Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .
[57] R. Brady. Optimization strategies gleaned from biological evolution , 1985, Nature.
[58] Kenneth Steiglitz,et al. On the Complexity of Local Search for the Traveling Salesman Problem , 1977, SIAM J. Comput..
[59] Gilbert Laporte,et al. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..
[60] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[61] J. Delosme,et al. An Efficient Simulated Annealing Schedule : Implementation and Evaluation , 1988 .
[62] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[63] Christos H. Papadimitriou,et al. The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem , 1992, SIAM J. Comput..
[64] B. Golden,et al. Using simulated annealing to solve routing and location problems , 1986 .
[65] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[66] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[67] James R. A. Allwright,et al. A distributed implementation of simulated annealing for the travelling salesman problem , 1989, Parallel Comput..
[68] Walter Kern,et al. A probabilistic analysis of the switching algorithm for the euclidean TSP , 1989, Math. Program..
[69] Edward W. Felten,et al. Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..
[70] Heinrich Braun,et al. On Solving Travelling Salesman Problems by Genetic Algorithms , 1990, PPSN.
[71] Bernard Angéniol,et al. Self-organizing feature maps and the travelling salesman problem , 1988, Neural Networks.
[72] Huang,et al. AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING , 1986 .
[73] R. Bland,et al. Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation , 1989 .
[74] Jan van Leeuwen,et al. Untangling a Travelling Salesman Tour in the Plane , 1981, WG.
[75] T. Liebling,et al. Probabilistic exchange algorithms and Euclidean traveling salesman problems , 1986 .
[76] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[77] V. Cerný. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .
[78] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[79] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.
[80] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[81] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[82] M.C.S. Boeres,et al. A faster elastic-net algorithm for the traveling salesman problem , 1992, [Proceedings 1992] IJCNN International Joint Conference on Neural Networks.
[83] Lamberto Cesari,et al. Optimization-Theory And Applications , 1983 .
[84] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[85] D. Mitra,et al. Convergence and finite-time behavior of simulated annealing , 1986, Advances in Applied Probability.
[86] Jacques Carlier,et al. A new heuristic for the traveling Salesman problem , 1990 .
[87] Martin W. Simmen. Parameter Sensitivity of the Elastic Net Approach to the Traveling Salesman Problem , 1991, Neural Computation.
[88] Jakob Krarup,et al. Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem , 1974, Math. Program..
[89] L. Wolsey. Heuristic analysis, linear programming and branch and bound , 1980 .
[90] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .
[91] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[92] Wansoo T. Rhee,et al. A sharp deviation inequality for the stochastic traveling salesman problem , 1989 .
[93] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[94] David P. Williamson,et al. Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application , 1990, Inf. Process. Lett..
[95] S. Kirkpatrick,et al. Configuration space analysis of travelling salesman problems , 1985 .
[96] Richard Szeliski,et al. An Analysis of the Elastic Net Approach to the Traveling Salesman Problem , 1989, Neural Computation.
[97] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.
[98] Paul D. Seymour,et al. Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.
[99] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[100] Emile H. L. Aarts,et al. Parallel Local Search and the Travelling Salesman Problem , 1992, Parallel Problem Solving from Nature.
[101] Jon Louis Bentley,et al. K-d trees for semidynamic point sets , 1990, SCG '90.
[102] J. Beardwood,et al. The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.
[103] Mark W. Krentel,et al. Structure in locally optimal solutions , 1989, 30th Annual Symposium on Foundations of Computer Science.
[104] Kenneth J. Supowit,et al. Simulated Annealing Without Rejected Moves , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[105] F. Glover,et al. The application of tabu search to the symmetric traveling salesman problem , 1989 .
[106] Jon Louis Bentley,et al. Experiments on traveling salesman heuristics , 1990, SODA '90.
[107] Heinz Mühlenbein,et al. Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..
[108] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[109] Emile H. L. Aarts,et al. Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.
[110] H. Crowder,et al. Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .
[111] Richard Durbin,et al. An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.
[112] X. Xu,et al. Effective neural algorithms for the traveling salesman problem , 1991, Neural Networks.
[113] N. E. Collins,et al. Simulated annealing - an annotated bibliography , 1988 .
[114] W. Krauth,et al. The Cavity Method and the Travelling-Salesman Problem , 1989 .
[115] Carsten Peterson,et al. A New Method for Mapping Optimization Problems Onto Neural Networks , 1989, Int. J. Neural Syst..
[116] Martin Grötschel,et al. Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..
[117] L. Darrell Whitley,et al. A Comparison of Genetic Sequencing Operators , 1991, ICGA.
[118] Jon Jouis Bentley,et al. Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..