The Analysis of Local Search Problems and Their Heuristics

[1]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[2]  Mihalis Yannakakis,et al.  Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..

[3]  Jorge J. Moré,et al.  On the solution of concave knapsack problems , 1990, Math. Program..

[4]  Mark W. Krentel,et al.  Structure in locally optimal solutions , 1989, 30th Annual Symposium on Foundations of Computer Science.

[5]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[6]  Anne Condon,et al.  Computational models of games , 1989, ACM distinguished dissertations.

[7]  Walter Kern,et al.  A probabilistic analysis of the switching algorithm for the euclidean TSP , 1989, Math. Program..

[8]  Mark W. Krentel.  On finding locally optimal solutions , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[9]  Donna Crystal Llewellyn,et al.  Local optimization on graphs , 1989, Discret. Appl. Math..

[10]  Emile H. L. Aarts,et al.  Combinatorial Optimization on a Boltzmann Machine , 1989, J. Parallel Distributed Comput..

[11]  Joseph W. Goodman,et al.  A generalized convergence theorem for neural networks , 1988, IEEE Trans. Inf. Theory.

[12]  Anthony Vannelli,et al.  A New Heuristic for Partitioning the Nodes of a Graph , 1988, SIAM J. Discret. Math..

[13]  Bruce E. Hajek,et al.  The time complexity of maximum matching by simulated annealing , 1988, JACM.

[14]  Jeffrey D. Ullman,et al.  Efficient tests for top-down termination of logical rules , 1988, JACM.

[15]  Michael Luby,et al.  Steepest Descent Can Take Exponential Time for Symmetric Connection Networks , 1988, Complex Syst..

[16]  P. Pardalos,et al.  Checking local optimality in constrained quadratic programming is NP-hard , 1988 .

[17]  Katta G. Murty,et al.  Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..

[18]  Vojtech Rödl,et al.  Multiple Optima in Local Search , 1987, J. Algorithms.

[19]  Craig A. Tovey,et al.  Low order polynomial bounds on the expected performance of local improvement algorithms , 1986, Math. Program..

[20]  B. Dickinson,et al.  The complexity of analog computation , 1986 .

[21]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[22]  Eric Goles Ch.,et al.  Decreasing energy functions as a tool for studying threshold networks , 1985, Discret. Appl. Math..

[23]  David S. Johnson,et al.  How Easy is Local Search? , 1985, J. Comput. Syst. Sci..

[24]  A. Wigderson,et al.  A fast parallel algorithm for the maximal independent set problem , 1985, JACM.

[25]  C. Tovey.  Hill Climbing with Multiple Local Optima , 1985 .

[26]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[27]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[28]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[29]  Eric Goles Ch.,et al.  The Convergence of Symmetric Threshold Automata , 1981, Inf. Control..

[30]  Michael J. Todd,et al.  The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4 , 1980, Math. Oper. Res..

[31]  Kenneth Steiglitz,et al.  Some Examples of Difficult Traveling Salesman Problems , 1978, Oper. Res..

[32]  V. G. Vizing.  Complexity of the traveling-salesman problem in the class of monotonic improvement algorithms , 1977, Cybernetics.

[33]  A. Bagchi,et al.  Neighborhood Search Algorithms for Guaranteeing Optimal Traveling Salesman Tours Must Be Inefficient , 1976, J. Comput. Syst. Sci..

[34]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[35]  Robert G. Jeroslow,et al.  The simplex algorithm with the pivot rule of maximizing criterion improvement , 1973, Discret. Math..

[36]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[37]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[38]  V. Klee,et al.  Thed-step conjecture for polyhedra of dimensiond<6 , 1967 .

[39]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[40]  R. Howard.  Dynamic Programming and Markov Processes , 1960 .

[41]  Jon Louis Bentley,et al.  Experiments on traveling salesman heuristics , 1990, SODA '90.

[42]  Martin Grötschel,et al.  Geometric Algorithms and Combinatorial Optimization , 1988, Algorithms and Combinatorics.

[43]  Brian W. Kernighan,et al.  A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[44]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[45]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[46]  Jan van Leeuwen,et al.  Untangling a Travelling Salesman Tour in the Plane , 1981, WG.

[47]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .