A greedy randomized adaptive search procedure for the 2-partition problem (1994)

by Thomas A. Feo , M. Pardalos
Venue:Operations Research
Citations:476 - 76 self

Documents Related by Co-Citation

145 A probabilistic heuristic for a computationally difficult set covering problem – T A Feo, M G C Resende - 1989
591 Tabu Search – Fred Glover - 1989
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
121 Scatter Search and Path Relinking – Fred Glover - 1999
272 Tabu Search – part II – F Glover - 1990
43 Improved constructive multi-start strategies for the quadratic assignment problem using adaptive memory – C Fleurent, F Glover - 1999
149 Local optimization and the traveling salesman problem – D S Johnson - 1990
105 Greedy Randomized Adaptive Search Procedures For The Steiner Problem In Graphs – Simone L. Martins, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro - 1999
79 GRASP: An annotated bibliography – Paola Festa, Mauricio, G. C. Resende - 2002
30 Semi-greedy heuristics: An empirical study – J P Hart, A W Shogan - 1987
99 Fundamentals of scatter search and path relinking – Fred Glover , Manuel Laguna , Rafael Martí - 2000
3505 Optimization by simulated annealing – S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi - 1983
307 Thermodynamically Approach to the Traveling Salesman Problem: An Efficient Simulation Algorithm – V Cerny - 1985
222 The Reactive Tabu Search – Roberto Battiti, Giampietro Tecchiolli, Istituto Nazionale, Fisica Nucleare - 1993
92 Large-Step Markov Chains for the Traveling Salesman Problem – Olivier Martin, Steve W. Otto, Edward W. Felten - 1991
272 The traveling salesman problem: A case study – David S Johnson, Lyle A Mcgeoch - 1997
60 Local search algorithms for combinatorial problems — analysis, improvements, and new applications – T Stützle - 1998
1439 Reducibility among combinatorial problems – R M Karp - 1972
148 The Stanford GraphBase: A Platform for Combinatorial Computing – Donald E Knuth - 1993