GRASP: An annotated bibliography

Operations Research/ Computer Science Interfaces Series

Volumn 15, Issue , 2002, Pages 325-367

  Festal, Paola ^a   Resende, Mauricio G C ^b  

^a UNIVERSITY OF SALERNO   (Italy)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84888798224     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4615-1507-4     Document Type: Article

References (187)

1. C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
2. S. Kirkpatrick. Optimization by Simulated Annealing: Quantitative Studies. Journal of Statistical Physics, 34:975-986, 1984.
3. F. Glover. Tabu search-Part I. ORSA Journal on Computing, 1:190-206,1989.
4. F. Glover. Tabu search-Part II. ORSA Journal on Computing, 2:4-32, 1990.
5. F. Glover and M. Laguna. Tabu Search. Kluwer, 1997.
6. D.E Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.
7. P. Hansen and N. Mladenovic. An Introduction to Variable Neighborhood Search. In: S. Voss, S. Martello, I.H. Osman, and C. Roucairol, editors, Meta-Heuristics, Advances and Trends in Local Search Paradigms for Optimization, pages 433-458. Kluwer, 1998.
8. T.A. Feo and M.G.C. Resende. A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem. Operations Research Letters, 8:67-71, 1989.
9. T.A. Feo and M.G.C. Resende. Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization, 6:109-133, 1995.
10. S. Lin and B.W. Kernighan. An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Operations Research, 21:498-516, 1973.
11. J.P. Hart and A.W. Shogan. Semi-Greedy Heuristics: An Empirical Study. Operations Research Letters, 6:107-114, 1987.
12. D.S. Johnson, C.H. Papadimitriou, and M. Yannakakis. How Easy is Local Search? Journal of Computer and System Sciences, 17:79-100, 1988.
13. T.A. Feo and M.G.C. Resende. Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization, 6:109-133, 1995.
14. J.L. Gonzalez. GRASP. In: Heuristic Optimization and Neural Networks in Operations Management and Engineering, A. Diaz, editor, pages 143-161. Editorial Paraninfo, 1996.
15. M.G.C. Resende. Greedy Randomized Adaptive Search Procedures (GRASP). To appear in: Encyclopedia of Optimization, Kluwer, 2001.
16. C.M.D. Silveira. GRASP-A Heuristic for Solving Combinatorial Optimization Problems. Technical Report, Institute of Informatics, Federal University of Rio Grande do SuI, Porto Alegre, 1999.
17. L.S. Pitsoulis and M.G.C. Resende. Greedy Randomized Adaptive Search Procedures. In: Handbook of Applied Optimization, P.M. Pardalos and M.G.C. Resende, editors, Oxford University Press, 2001.
18. J.L. Bresina. Heuristic-Biased Stochastic Sampling. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, pages 271-278,1996.
19. J. Mockus, E. Eddy, A. Mockus, L. Mockus, and G.V. Reklaitis. Bayesian Discrete and Global Optimization. Kluwer, 1997.
20. J.B. Atkinson. A Greedy Randomised Search Heuristic for Time-Constrained Vehicle Scheduling and the Incorporation of a Learning Strategy. Journal of the Operational Research Society, 49:700-708, 1998.
21. C. Fleurent and F. Glover. Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory. INFORMS Journal on Computing, 11:198-204, 1999.
22. M. Laguna and R. Marti. GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization. INFORMS Journal on Computing, 11:44-52, 1999.
23. M. Prais. Parameter Variation in GRASP Procedures. Ph.D. Thesis, Department of Computer Sciences, Catholic University of Rio de Janeiro, Rio de Janeiro, 2000.
24. M. Prais and C.C. Ribeiro. Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA 'fraffic Assignment. INFORMS Journal on Computing, 12:164-176,2000.
25. M. Prais and C.C. Ribeiro. Parameter Variation in GRASP Procedures. Investigaci6n Operativa, 9:1-20, 2000.
26. C.C. Ribeiro, E. Uchoa, and R.F. Werneck. A Hybrid GRASP with Perturbations and Adaptive Path-Relinking for the Steiner Problem in Graphs. Technical Report, Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, 2000.
27. M. Laguna and J.L. Gonzruez-Velarde. A Search Heuristic for Just-inTime Scheduling in Parallel Machines. Journal of Intelligent Manufacturing, 2:253-260, 1991.
28. M. Yagiura and T. Ibakari. Genetic and Local Search Algorithms as Robust and Simple Optimization Tools. In: Meta-Heuristics: Theory and Applications, LH. Osman and J.P. Kelly, editors, pages 63-82. Kluwer, 1996.
29. [] R. Colome and D. Serra. Consumer Choice in Competitive Location Models: Formulations and Heuristics. To appear in: Papers in Regional Science.
30. H. Ramalhinho Lourenao, J.P. Paixiio, and R. Portugal. Metaheuristics for the Bus-Driver Scheduling Problem. Technical Report, Department of Economics and Management, Universitat Pompeu Fabra, Barcelona, 1998.
31. H. Delmaire, J.A. Diaz, E. Fernandez, and M. Ortega. Reactive GRASP and Tabu Search Based Heuristics for the Single Source Capacitated Plant Location Problem. INFOR, 37:194-225, 1999.
32. R.K. Ahuja, J.B. Orlin, and A. Tiwari. A Greedy Genetic Algorithm for the Quadratic Assignment Problem. Computers and Operations Research, 27:917-934, 2000.
33. M. Armony, JG. Klincewicz, H. Luss, and M.B. Rosenwein. Design of Stacked Self-Healing Rings using a Genetic Algorithm. Journal of Heuristics, 6:85-105, 2000.
34. S. Abdinnour-Helm and S.W. Hadley. Tabu Search Based Heuristics for Multi-Floor Facility Layout. International Journal of Production Research, 38:365-383,2000.
35. C.C. Ribeiro, E. Uchoa, and R.F. Werneck. A Hybrid GRASP with Perturbations and Adaptive Path-Relinking for the Steiner Problem in Graphs. Technical Report, Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, 2000.
36. T.A. Feo, M.G.C. Resende, and S.H. Smith. A greedy Randomized Adaptive Search Procedure for Maximum Independent Set. Operations Research, 42:860-878, 1994.
37. P.M. Pardalos, L. Pitsoulis, T. Mavridou, and M.G.C. Resende. Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing and GRASP. Lecture Notes in Computer Science, 980:317-331, 1995.
38. P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. A Parallel GRASP Implementation for the Quadratic Assignment Problem. In: Parallel Algorithms for Irregularly Structured Problems-Irregular'94, A. Ferreira and J. Rolim, editors, pages 115-130, Kluwer, 1995.
39. P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. A Parallel GRASP for MAX-SAT Problems. Lecture Notes in Computer Science, 1184:575-585, 1996.
40. A.C.F. Alvim. Parallelization Strategies for the Metaheuristic GRASP. Master's Thesis, Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, 1998.
41. A.C.F. Alvim and C.C. Ribeiro. Load Balancing in the Parallelization of the Metaheuristic GRASP. In: Proceedings of the X Brazilian Symposium on Computer Architecture, pages 279-282, Buzios, 1998.
42. S.L. Martins, C.C. Ribeiro, and M.C. Souza. A Parallel GRASP for the Steiner Problem in Graphs. Lecture Notes in Computer Science, 1457:285-297, 1998.
43. R.A. Murphey, P.M. Pardalos, and L.S. Pitsoulis. A Parallel GRASP for the Data Association Multidimensional Assignment Problem. The IMA Volumes in Mathematics and its Applications, 106:159-180,1998.
44. P.M. Pardalos, M.G.C. Resende, and J. Rappe. An Exact Parallel Algorithm for the Maximum Clique Problem. In: High Performance Algorithms and Software in Nonlinear Optimization, R. De Leone, A. Murli, P.M. Pardalos, and G. Toraldo, editors, pages 279-300. Kluwer, 1998.
45. L.I.D. Rivera. Evaluation of Parallel Implementations of Heuristics for the Course Scheduling Problem. Master's Thesis, Instituto Tecnologico y de Estudios Superiores de Monterrey, Monterrey, 1998.
46. S.L. Martins. Parallelization Strategies for Metaheuristics in Distributed Memory Environments. Ph.D. Thesis, Department of Computer Sciences, Catholic University of Rio de Janeiro, Rio de Janeiro, 1999.
47. [] R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro. Probability Distribution of Solution Time in GRASP: An Experimental Investigation. To appear in: Journal of Heuristics.
48. R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo. GRASP with Path Relinking for the Three-Index Assignment Problem. Technical Report, AT&T Labs Research, Florham Park, 2000.
49. S.L. Martins, M.G.C. Resende, C.C. Ribeiro, and P.M. Pardalos. A Parallel GRASP for the Steiner Tree Problem in Graphs using a Hybrid Local Search Strategy. Journal of Global Optimization, 17:267-283, 2000.
50. M.G.C. Resende, P.M. Pardalos, and Y. Li. Algorithm 754: Fortran Subroutines for Approximate Solution of Dense Quadratic Assignment Problems using GRASP. ACM Transactions on Mathematical Software, 22:104-118, 1996.
51. P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. Algorithm 769: Fortran Subroutines for Approximate Solution of Sparse Quadratic Assignment Problems using GRASP. ACM Transactions on Mathematical Software, 23:196-208, 1997.
52. M.G.C. Resende, T.A. Feo, and S.H. Smith. Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems using GRASP. ACM Transactions on Mathematical Software, 24: 386-394, 1998.
53. [] P. Festa, P.M. Pardalos, and M.G.C. Resende. FORTRAN Subroutines for Computing Approximate Solution to Feedback Set Problems using GRASP. To appear in: ACM Transactions on Mathematical Software.
54. C.C. Ribeiro and M.G.C. Resende. Algorithm 797: Fortran Subroutines for Approximate Solution of Graph Planarization Problems using GRASP. ACM Transactions on Mathematical Software, 25:341-352, 1999.
55. M.G.C. Resende, L.S. Pitsoulis, and P.M. Pardalos. Fortran Subroutines for Computing Approximate Solutions of MAX-SAT Problems using GRASP. Discrete Applied Mathematics, 100:95-113,2000.
56. J.F. Bard and T.A. Feo. Operations Sequencing in Discrete Parts Manufacturing. Management Science, 35:249-255, 1989.
57. T.A. Feo and J.F. Bard. Flight Scheduling and Maintenance Base Planning. Management Science, 35:1415-1432, 1989.
58. T.A. Feo, K. Venkatraman, and J.F. Bard. A GRASP for a Difficult Single Machine Scheduling Problem. Computers and Operations Research, 18:635-643, 1991.
59. M. Laguna and J.L. Gonzalez-Velarde. A Search Heuristic for Just-inTime Scheduling in Parallel Machines. Journal of Intelligent Manufacturing, 2:253-260, 1991.
60. P. De, J.B. Ghosj, and C.E. Wells. Solving a Generalized Model for Con Due Date Assignment and Sequencing. International Journal of Production Economics, 34:179-185, 1994.
61. T.A. Feo, J.F. Bard, and S. Holland. Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly. Operations Research, 43:219-230, 1995.
62. J.F. Bard, T.A. Feo, and S. Holland. A GRASP for Scheduling Printed Wiring Board Assembly. IIE Transactions, 28:155-165, 1996.
63. T.A. Feo, K. Sarathy, and J. McGahan. A GRASP for Single Machine Scheduling with Sequence Dependent Setup Costs and Linear Delay Penalties. Computers and Operations Research, 23:881-895, 1996.
64. J. Xu and S. Chiu. Solving a Real-World Field Technician Scheduling Problem. In: Proceedings of the International Conference on Management Science and the Economic Development of China, pages 240-248, 1996.
65. H. Ramalhinho Lourenao, J.P. Paixao, and R. Portugal. Metaheuristics for the Bus-Driver Scheduling Problem. Technical Report, Department of Economics and Management, Universitat Pompeu Fabra, Barcelona, 1998.
66. R.Z. Rios-Mercado and J.F. Bard. Heuristics for the Flow Line Problem with Setup Costs. European Journal of Operational Research, 110:76-98, 1998.
67. L.I.D. Rivera. Evaluation of Parallel Implementations of Heuristics for the Course Scheduling Problem. Master's Thesis, Instituto Tecnologico y de Estudios Superiores de Monterrey, Monterrey, 1998.
68. [] J. Xu and S. Chiu. Effective Heuristic Procedure for a Field Technician Scheduling Problem. To appear in: Journal of Heuristics.
69. R.Z. Rios-Mercado and J.F. Bard. An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Costs. Journal of Heuristics, 5:57-74, 1999.
70. [] S. Binato, W.J. Hery, D. Loewenstern, and M.G.C. Resende. A Greedy Randomized Adaptive Search Procedure for Job Shop Scheduling. In: Essays and Surveys on Metaheuristics, C.C. Ribeiro and P. Hansen, editors, Kluwer, 2001 (this volume).
71. C.A. Hjorring. The Vehicle Routing Problem and Local Search Metaheuristics. Ph.D. Thesis, University of Auckland, Auckland, 1995.
72. G. Kontoravdis and J.F. Bard. A GRASP for the Vehicle Routing Problem with Time Windows. ORSA Journal on Computing, 7:10-23, 1995.
73. M.F. Arguello, J.F. Bard, and G. Yu. A GRASP for Aircraft Routing in Response to Groundings and Delays. Journal of Combinatorial Optimization, 1:211-228,1997.
74. J.B. Atkinson. A Greedy Randomised Search Heuristic for Time-Constrained Vehicle Scheduling and the Incorporation of a Learning Strategy. Journal of the Operational Research Society, 49:700-708, 1998.
75. J.F. Bard, L. Huang, P. Jaillet, and M. Dror. A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities. Transportation Science, 32:189-203, 1998.
76. L.I.P. Resende and M.G.C. Resende. A GRASP for Frame Relay PVC Routing. In: Extended Abstracts of the Third Metaheuristics International Conference, pages 397-402, Angra dos Reis, 1999.
77. A. Corberan, R. Marti, and J.M. Sanchis. A GRASP for the Mixed Postman Problem. Technical Report, Department of Statistics and Operations Research, University of Valencia, Valencia, 2000.
78. [] C. Carreto and B. Baker. A GRASP Interactive Approach to the Vehicle Routing Problem with Backhauls. In: Essays and Surveys on Metaheuristics, C.C. Ribeiro and P. Hansen, editors, Kluwer, 2001 (this volume).
79. M.G.C. Resende and T.A. Feo. A GRASP for Satisfiability. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 26:499-520,1996.
80. P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. A Parallel GRASP for MAX-SAT Problems. Lecture Notes in Computer Science, 1184:575-585,1996.
81. M.G.C. Resende, L.S. Pitsoulis, and P.M. Pardalos. Approximate Solution of Weighted MAX-SAT Problems using GRASP. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 35:393-405, 1997.
82. A.S. Deshpande and E. Triantaphyllou. A Greedy Randomized Adaptive Search Procedure (GRASP) for Inferring Logical Clauses from Examples in Polynomial Time and some Extensions. Mathematical and Computer Modelling, 27:75-99, 1998.
83. M.G.C. Resende, L.S. Pitsoulis, and P.M. Pardalos. Fortran Subroutines for Computing Approximate Solutions of MAX-SAT problems using GRASP. Discrete Applied Mathematics, 100:95-113,2000.
84. M.F. Argiiello, T.A. Feo, and O. Goldschmidt. Randomized Methods for the Number Partitioning Problem. Computers and Operations Research, 23:103-111, 1996.
85. S. Areibi and A. Vannelli. A GRASP Clustering Technique for Circuit Partitioning. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 35:711-724, 1997.
86. S.M. Areibi. GRASP: An Effective Constructive Technique for VLSI Circuit Partitioning. In: Proceedings of IEEE Canadian Conference on Electrical and Computer Engineering, Edmonton, 1999.
87. J.G. Klincewicz. Avoiding Local Optima in the,rHub Location Problem using Tabu Search and GRASP. Annals of Operations Research, 40:283-302, 1992.
88. H. Delmaire, J.A. Diaz, E. Fernandez, and M. Ortega. Comparing New Heuristics for the Pure Integer Capacitated Plant Location Problem. Technical Report DR97/1O, Department of Statistics and Operations Research, Universitat Politecnica de Catalunya, Barcelona, 1997.
89. K. Holmqvist, A. Migdalas, and P.M. Pardalos. Greedy Randomized Adaptive Search for a Location Problem with Economies of Scale. In: Developments in Global Optimization, I.M. Bomze, T. Csendes, R. Horst, and P.M. Pardalos, editors, pages 301-313. Kluwer, 1997.
90. T.L. Urban. Solution Procedures for the Dynamic Facility Layout Problem. Annals of Operations Research, 76:323-342, 1998.
91. H. Delmaire, J.A. Diaz, E. Fernandez, and M. Ortega. Reactive GRASP and Tabu Search Based Heuristics for the Single Source Capacitated Plant Location Problem. INFOR, 37:194-225, 1999.
92. M.J.N. Gomes and J.B.C. da Silva. An Experimental Evaluation of the GRASP Metaheuristic Applied to the Uncapacitated Location Problem. Technical Report 004/99, Department of Statistics and Computation, State University of Ceara, Fortaleza, 1999.
93. S. Abdinnour-Helm and S.W. Hadley. Tabu Search Based Heuristics for Multi-Floor Facility Layout. International Journal of Production Research, 38:365-383, 2000.
94. T.L. Urban, W.-C. Chiang, and R.A. Russel. The Integrated Machine Allocation and Layout Problem. International Journal of Production Research, 76:2911-2930,2000.
95. T.A. Feo, M.G.C. Resende, and S.H. Smith. A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set. Operations Research, 42:860-878, 1994.
96. M. Laguna, T.A. Feo, and H.C. Elrod. A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem. Operations Research, 42:677-687, 1994.
97. E.M. Macambira and C.C. de Souza. A GRASP for the Maximum Clique Problem with Weighted Edges. In: Proceedings of the XXIX Brazilian Symposium on Operations Research, page 70, 1997.
98. R Marti and M. Laguna. Heuristics and Meta-Heuristics for 2-Layer Straight Line Crossing Minimization. Technical Report, Department of Statistics and Operations Research, University of Valencia, Valencia, 1997.
99. M.G.C. Resende and C.C. Ribeiro. A GRASP for Graph Planarization. Networks, 29:173-189, 1997.
100. RK. Ahuja, J.B. Orlin, and D. Sharma. New Neighborhood Search Structures for the Capacitated Minimum Spanning Tree Problem. Technical Report, Department of ISE, University of Florida, Gainesville, 1998.
101. M. Laguna and R Marti. A GRASP for Coloring Sparse Graphs. To appear in: Computational Optimization and Applications.
102. E.M. Macambira and C.N. Meneses. A GRASP Algorithm for the Maximum Weighted Edge Subgraph Problem. Technical Report, Department of Statistics and Computation, University of Ceara, Fortaleza, 1998.
103. S.L. Martins, C.C. Ribeiro, and M.C. Souza. A Parallel GRASP for the Steiner Problem in Graphs. Lecture Notes in Computer Science, 1457:285-297, 1998.
104. P.M. Pardalos, M.G.C. Resende, and J. Rappe. An Exact Parallel Algorithm for the Maximum Clique Problem. In: High Performance Algorithms and Software in Nonlinear Optimization, R. De Leone, A. Murli, P.M. Pardalos, and G. Toraldo, editors, pages 279-300. Kluwer, 1998.
105. M.G.C. Resende. Computing Approximate Solutions of the Maximum Covering Problem using GRASP. Journal of Heuristics, 4:161-171, 1998.
106. M.G.C. Resende, T.A. Feo, and S.H. Smith. Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems using GRASP. ACM Transactions on Mathematical Software, 24: 386-394, 1998.
107. E. Rolland, R.A. Patterson, and H. Pirkul. Memory Adaptive Reasoning and Greedy Assignment Techniques for the Capacitated Minimum Spanning Tree Problem. Technical Report, Department of Accounting and Management Information Systems, Fisher College of Business, The Ohio State University, Columbus, 1998.
108. J. Abello, P.M. Pardalos, and M.G.C. Resende. On Maximum Clique Problems in Very Large Graphs. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 50:199-130, 1999.
109. [] P. Festa, P.M. Pardalos, and M.G.C. Resende. FORTRAN Subroutines for Computing Approximate Solution to Feedback Set Problems using GRASP. To appear in: ACM Transactions on Mathematical Software.
110. S.L. Martins, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro. Greedy Randomized Adaptive Search Procedures for the Steiner Problem in Graphs. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 43:133-145, 1999.
111. P.M. Pardalos, T. Qian, and M.G.C. Resende. A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem. Journal of Combinatorial Optimization, 2:399-412, 1999.
112. C.C. Ribeiro and M.G.C. Resende. Fortran Subroutines for Approximate Solution of Graph Planarization Problems using GRASP. ACM Transactions on Mathematical Software, 25:341-352, 1999.
113. S.L. Martins, M.G.C. Resende, C.C. Ribeiro, and P.M. Pardalos. A Parallel GRASP for the Steiner Tree Problem in Graphs using a Hybrid Local Search Strategy. Journal of Global Optimization, 17:267-283, 2000.
114. I.H. Osman, B. AI-Ayoubi, M. Barake, and M. Hasan. A Greedy Random Adaptive Search Procedure for the Weighted Maximal Planar Graph Problem. Technical Report, School of Business and Center for Advanced Mathematical Sciences, American University of Beirut, Beirut, 2000.
115. C.C. Ribeiro, E. Uchoa, and R.F. Werneck. A Hybrid GRASP with Perturbations and Adaptive Path-Relinking for the Steiner Problem in Graphs. Technical Report, Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, 2000.
116. [] R. Marti. Arc Crossing Minimization in Graphs with GRASP. To appear in: IIE Transactions.
117. R. Marti and V. Estruch. Incremental Bipartite Drawing Problem. To appear in: Computers and Operations Research, 2001.
118. Y. Li, P.M. Pardalos, and M.G.C. Resende. A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 16:237-261, 1994.
119. T.A. Feo and J.L. Gonzalez-Velarde. The Intermodal Trailer Assignment Problem: Models, Algorithms, and Heuristics. Transportation Science, 29:330-341, 1995.
120. P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. A Parallel GRASP Implementation for the Quadratic Assignment Problem. In: Parallel Algorithms for Irregularly Structured Problems-Irregular'94, A. Ferreira and J. Rolim, editors, pages 115-130. Kluwer, 1995.
121. M.G.C. Resende, P.M. Pardalos, and Y. Li. Algorithm 754: Fortran Subroutines for Approximate Solution of Dense Quadratic Assignment Problems using GRASP. ACM Transactions on Mathematical Software, 22:04-118, 1996.
122. P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. Algorithm 769: Fortran Subroutines for Approximate Solution of Sparse Quadratic Assignment Problems using GRASP. ACM Transactions on Mathematical Software, 23:196-208, 1997.
123. R.A. Murphey, P.M. Pardalos, and L.S. Pitsoulis. A Parallel GRASP for the Data Association Multidimensional Assignment Problem. The IMA Volumes in Mathematics and its Applications, 106:159-180,1998.
124. T. Mavridou, P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. A GRASP for the Biquadratic Assignment Problem. European Journal of Operational Research, 105:613-621, 1998.
125. E.L. Pasiliao. A Greedy Randomized Adaptive Search Procedure for the Multi-Criteria Radio Link Frequency Assignment Problem. Technical Report, Department of ISE, University of Florida, Gainesville, 1998.
126. M.C. Rangel, N.M.M. de Abreu, P.O. Boaventura Netto, and M.C.S. Boeres. A Modified Local Search for GRASP in the Quadratic Assignment Problem. Technical Report, Production Engineering Program, COPPE, Federal University of Rio de Janeiro, Rio de Janeiro, 1998.
127. [] A.J. Robertson. A Set of Greedy Randomized Adaptive Local Search Procedure (GRASP) Implementations for the Multidimensional Assignment Problem. To appear in: Computational Optimization and Applications.
128. C. Fleurent and F. Glover. Improved Constructive Multistart Strategies for the Quadratic Assignment Problem using Adaptive Memory. INFORMS Journal on Computing, 11:198-204, 1999.
129. C.A.S. Oliveira and F.C. Gomes. Two Metaheuristics for Channel Allocation in Mobile Telephony. Technical Report, Artificial Intelligence Laboratory, Universidade Federal do Ceara, Fortaleza, 1999.
130. L.S. Pitsoulis. Algorithms for Nonlinear Assignment Problems. Ph.D. Thesis, Department of Industrial and Systems Engineering, University of Florida, 1999.
131. R.K. Ahuja, J.B. Orlin, and A. Tiwari. A Greedy Genetic Algorithm for the Quadratic Assignment Problem. Computers and Operations Research, 27:917-934, 2000.
132. R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo. GRASP with Path Relinking for the Three-Index Assignment Problem. Technical Report, AT&T Labs Research, Florham Park, 2000.
133. X. Liu, P.M. Pardalos, S. Rajasekaran, and M.G.C. Resende. A GRASP for Frequency Assignment in Mobile Radio Networks. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 52:195-201, 2000.
134. M. Prais and C.C. Ribeiro. Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA 'fraffic Assignment. INFORMS Journal on Computing, 12:164-176,2000.
135. M.C. Rangel, N.M.M. Abreu, and P.O. Boaventura Netto. GRASP in the QAP: An Acceptance Bound for Initial Solutions. Pesquisa Operacional, 20:45-58, 2000.
136. [] A. Srinivasan, K.G. Ramakrishnan, K. Kumaram, M. Aravamudam, and S. Naqvi. Optimal Design of Signaling Networks for Internet Telephony. In: Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Online document, http://www.ieee-infocom.org/2000/papers/352.ps, Tel Aviv, 2000.
137. L.S. Pitsoulis, P.M. Pardalos, and D.W. Hearn. Approximate Solutions to the Turbine Balancing Problem. European Journal of Operational Research, 130:147-155,2001.
138. J.F. Bard and T.A. Feo. Operations Sequencing in Discrete Parts Manufacturing. Management Science, 35:249-255, 1989.
139. T.A. Feo and J.F. Bard. The Cutting Path and Tool Selection Problem in Computer-Aided Process Planning. Journal of Manufacturing Systems, 8:17-26, 1989.
140. J.F. Bard and T.A. Feo. An Algorithm for the Manufacturing Equipment Selection Problem. IIE Transactions, 23:83-92, 1991.
141. J.G. Klincewicz and A. Rajan. Using GRASP to Solve the Component Grouping Problem. Naval Research Logistics, 41:893-912, 1994.
142. T.A. Feo, J.F. Bard, and S. Holland. Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly. Operations Research, 43:219-230, 1995.
143. J.F. Bard, T.A. Feo, and S. Holland. A GRASP for Scheduling Printed Wiring Board Assembly. IIE. Transactions, 28:155-165, 1996.
144. J. Yen, M. Carlsson, M. Chang, J.M. Garcia, and H. Nguyen. Constraint Solving for Inkjet Print Mask Design. Journal of Imaging Science and Technology, 44:391-397,2000.
145. T.A. Feo and J.F. Bard. Flight Scheduling and Maintenance Base Planning. Management Science, 35:1415-1432, 1989.
146. T.A. Feo and J.L. Gonzalez-Velarde. The Intermodal Trailer Assignment Problem: Models, Algorithms, and Heuristics. Transportation Science, 29:330-341, 1995.
147. M.F. Argiiello, J.F. Bard, and G. Yu. A GRASP for Aircraft Routing in Response to Groundings and Delays. Journal of Combinatorial Optimization, 1:211-228, 1997.
148. J.F. Bard. An Analysis of a Rail Car Unloading Area for a Consumer Products Manufacturer. Journal of the Operational Research Society, 48:873-883, 1997.
149. D. Sosnowska. Optimization of a Simplified Fleet Assignment Problem with Metaheuristics: Simulated Annealing and GRASP. In: Approximation and Complexity in Numerical Optimization, P.M. Pardalos, editor, Kluwer, 2000.
150. J.G. Klincewicz. Avoiding Local Optima in the p-Hub Location Problem using Tabu Search and GRASP. Annals of Operations Research, 40:283-302,1992.
151. J. Xu and S. Chiu. Solving a Real-World Field Technician Scheduling Problem. In: Proceedings of the International Conference on Management Science and the Economic Development of China, pages 240-248, 1996.
152. F. Poppe, M. Pickavet, P. Arijs, and P. Demeester. Design Techniques for SDH Mesh-Restorable Networks. In: Proceedings of the European Conference on Networks and Optical Communications, vol. 2, Core and ATM Networks, pages 94-101, Antwerp, 1997.
153. L.I.P. Resende and M.G.C. Resende. A GRASP for Frame Relay PVC Routing. In: Extended Abstracts of the Third Metaheuristics International Conference, pages 397-402, Angra dos Reis, 1999.
154. M.G.C. Resende and O. Ulular. SMART: A Tool for AT&T Worldnet Access Design-Location of Cascade 9000 Concentrators. Technical Report, AT&T Labs Research, Florham Park, 1997.
155. E.L. Pasiliao. A Greedy Randomized Adaptive Search Procedure for the Multi-Criteria Radio Link Frequency Assignment Problem. Technical Report, Department of ISE, University of Florida, Gainesville, 1998.
156. M.G.C. Resende. Computing Approximate Solutions of the Maximum Covering Problem using GRASP. Journal of Heuristics, 4:161-171, 1998.
157. J. Xu and S. Chiu. Effective Heuristic Procedure for a Field Technician Scheduling Problem. Technical Report, US WEST Advanced Technologies, Boulder, 1998.
158. J. Abello, P.M. Pardalos, and M.G.C. Resende. On Maximum Clique Problems in Very Large Graphs. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 50:119-130, 1999.
159. C.A.S. Oliveira and F.C. Gomes. Two Metaheuristics for Channel Allocation in Mobile Telephony. Technical Report, Artificial Intelligence Laboratory, Universidade Federal do Ceara, Fortaleza, 1999.
160. M. Armony, J.G. Klincewicz, H. Luss, and M.B. Rosenwein. Design of Stacked Self-Healing Rings using a Genetic Algorithm. Journal of Heuristics, 6:85-105, 2000.
161. X. Liu, P.M. Pardalos, S. Rajasekaran, and M.G.C. Resende. A GRASP for Frequency Assignment in Mobile Radio Networks. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 52:195-201, 2000.
162. J.G. Klincewicz. Enumeration and Search Procedures for a Hub Location Problem with Economies of Scale. Technical Report, AT&T Labs, Middletown, 2000.
163. M. Prais and C.C. Ribeiro. Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Thaffic Assignment. INFORMS Journal on Computing, 12:164-176, 2000.
164. [] A. Srinivasan, K.G. Ramakrishnan, K. Kumaram, M. Aravamudam, and S. Naqvi. Optimal Design of Signaling Networks for Internet Telephony. In: Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Online document, http://www.ieee-infocom.org/2000/papers/352.ps, Tel Aviv, 2000.
165. R. Marti and M. Laguna. Heuristics and Meta-Heuristics for 2-Layer Straight Line Crossing Minimization. Technical Report, Department of Statistics and Operations Research, University of Valencia, Valencia, 1997.
166. M.G.C. Resende and C.C. Ribeiro. A GRASP for Graph Planarization. Networks, 29:173-189, 1997.
167. E. Fernandez and R. Marti. GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps. Journal of Heuristics, 5:181-197, 1999.
168. M. Laguna and R. Marti. GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization. INFORMS Journal on Computing, 11:44-52, 1999.
169. C.C. Ribeiro and M.G.C. Resende. Algorithm 797: Fortran Subroutines for Approximate Solution of Graph Planarization Problems using GRASP. ACM Transactions on Mathematical Software, 25:341-352, 1999.
170. R. Marti. Arc Crossing Minimization in Graphs with GRASP. To appear in: IEE Transactions, 2001.
171. R. Marti and V. Estruch. Incremental Bipartite Drawing Problem. To appear in: Computers and Operations Research, 2001.
172. S. Binato, G.C. Oliveira, and J.L. Araujo. A Greedy Randomized Adaptive Search Procedure for Transmission Expansion Planning. Technical Report, Research Centre for Electrical Energy-CEPEL, Rio de Janeiro, 1998.
173. [] S. Binato and G.C. Oliveira. A Reactive GRASP for Transmission Network Expansion Planning. In: Essays and Surveys in Metaheuristics, C.C. Ribeiro and P. Hansen, editors, Kluwer, 2001 (this volume).
174. S. Areibi and A. Vannelli. A GRASP Clustering Technique for Circuit Partitioning. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 35:711-724, 1997.
175. S.M. Areibi. GRASP: An Effective Constructive Technique for VLSI Circuit Partitioning. In: Proceedings of IEEE Canadian Conference on Electrical and Computer Engineering, Edmonton, 1999.
176. T.A. Feo and M.G.C. Resende. A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem. Operations Research Letters, 8:67-71, 1989.
177. J.B. Ghosh. Computational Aspects of the Maximum Diversity Problem. Operations Research Letters, 19:175-181,1996.
178. [] R. Colome and D. Serra. Consumer Choice in Competitive Location Models: Formulations and Heuristics. To appear in: Papers in Regional Science.
179. X. Gandibleux, D. Vancoppenolle, and D. Thyttens. A First Making use of GRASP for Solving MOCO Problems. Technical Report, University of Valenciennes, 1998.
180. K. Holmqvist, A. Migdalas, and P.M. Pardalos. A GRASP Algorithm for the Single Source Uncapacitated Minimum Concave-Cost Network Flow Problem. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 40:131-142, 1998.
181. N. Krasnogor, D.A. Pelt a, W. Russo, and G. Terrazas. A GRASP Approach to the Protein Structure Prediction Problem. Technical Report, LIFIA Lab, University of La Plata, La Plata, 1998.
182. R.A. Murphey, P.M. Pardalos, and L.S. Pitsoulis. A Greedy Randomized Adaptive Search Procedure for the Multitarget Multisensor Tracking Problem. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 40:277-301, 1998.
183. P.L. Hammer and D.J. Rader, Jr. Maximally Disjoint Solutions of the Set Covering Problem. Journal of Heuristics, 7:131-144,2001.
184. M.C. Medeiros, M.G.C. Resende, and A. Veiga. Piecewise Linear Time Series Estimation with GRASP. Computational Optimization and Applications, 19:127-144,2001.
185. [] M.C. Medeiros, A. Veiga, and M.G.C. Resende. A Combinatorial Approach to Piecewise Linear Time Series Analysis. To appear in: Journal of Graphical and Computational Statistics.
186. J.R. Cano, O. Cordon, F. Herrera, and L. Sanchez. A Greedy Randomized Adaptive Search Procedure for the Clustering Problem. Technical Report, Department of Computer Science and Artificial Intelligence, University of Granada, 2000.
187. L.S. Pitsoulis, P.M. Pardalos, and D.W. Hearn. Approximate Solutions to the Turbine Balancing Problem. European Journal of Operational Research, 130:147-155, 2001.