GRASP: An annotated bibliography

1. Parallel GRASP with path-relinking for job shop scheduling

   R.M. Aiex, S. Binato, and M.G.C. Resende

   Parallel Computing, 29:393-430, 2003.

2. A GRASP for aircraft routing in response to groundings and delays

   M.F. Argüello, J.F. Bard, and G. Yu

   Journal of Combinatorial Optimization, 1:211-228, 1997.

3. Planning UMTS base station location: Optimization models with power control and algorithms

   E. Amaldi, A. Capone, and F. Malucelli

   IEEE Transactions on Wireless Communications, 2(5):939-952, 2003.

4. Optimization models and algorithms for downlink UMTS radio planning

   E. Amaldi, A. Capone, F. Malucelli, and F. Signori

   In Wireless Communications and Networking, 2003 (WCNC 2003), volume 2, pages 827-831, March 2003.

5. An object-oriented framework for local search heuristics

   A.A. Andreatta, S.E.R. Carvalho, and C.C. Ribeiro

   In Proceedings of the 26th TOOLS USA '98 -- Technology of Object-Oriented Languages and Systems, pages 33-45. IEEE Computer Society, 1998.

6. A framework for the development of local search heuristics for combinatorial optimization problems

   A.A. Andreatta, S.E.R. Carvalho, and C.C. Ribeiro

   In S. Voss and D. Woodruff, editors, Optimization Software Class Libraries, pages 59-79. Kluwer Academic Publishers, 2002.

7. Randomized methods for the number partitioning problem

   M.F. Argüello, T.A. Feo, and O. Goldschmidt

   Computers & Operations Research, 23(2):103-111, 1996.

8. Scatter search for a network design problem

   A.M. Álvarez, J. L. González, and K. De-Alba

   Technical Report PISIS-2003-02, Universidad Autónoma de Nuevo León, Facultad de Ingeniería Mecánica y Eléctrica, División de Posgrado en Ingeniería de Sistemas, Mexico., 2003.

9. Tabu search based heuristics for multi-floor facility layout

   S. Abdinnour-Helm and S.W. Hadley

   International Journal of Production Research, 38:365-383, 2000.

10. Uma investigação experimental da distribuição de probabilidade de tempo de solução em heurísticas GRASP e sua aplicação na análise de implementações paralelas

    R.M. Aiex

    PhD thesis, Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil, 2002.

11. Generating short-term observations for space mission projects

    M.S. Akturk and K. Kiliç

    J. of Intelligent Manufacturing, 10:387-404, 1999.

12. Design of stacked self-healing rings using a genetic algorithm

    M. Armony, J.G. Klincewicz, H. Luss, and M.B. Rosenwein

    Journal of Heuristics, 6:85-105, 2000.

13. Parallelization strategies for the metaheuristic GRASP

    A.C.F. Alvim

    Master's thesis, Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, RJ 22453-900 Brazil, April 1998.

14. A comparison of genetic/memetic algorithms and other heuristic search techniques

    S. Areibi, M. Moussa, and H. Abdullah

    In Proceedings of IC-AI 2001, July 25 2001.

15. GRASP and tabu search algorithms for computing the forwarding index in a graph

    E. Arráiz, A. Martínez, O. Meza, and M. Ortega

    In Proceedings of MIC'2001, pages 367-370, July 16-20 2001.

16. A new dominance rule to minimize total weighted tardiness with unequal release dates

    M.S. Akturk and D. Ozdemir

    European Journal of Operational Research, 135:394-412, 2001.

17. Greedy random adaptive memory programming search for the capacitated clustering problem

    S. Ahmadi and I.H. Osman

    European Journal of Operational Research, 2003, To appear.

18. Multi-exchange neighborhood search structures for the capacitated minimum spanning tree problem

    R.K. Ahuja, J.B. Orlin, and D. Sharma

    Mathematical Programming, 91:71-97, 2001.

19. A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem

    R.K. Ahuja, J.B. Orlin, and D. Sharma

    Operations Research Letters, 31(3):185-194, 2003.

20. A greedy genetic algorithm for the quadratic assignment problem

    R.K. Ahuja, J.B. Orlin, and A. Tiwari

    Computers and Operations Research, 27:917-934, 2000.

21. On maximum clique problems in very large graphs

    J. Abello, P.M. Pardalos, and M.G.C. Resende

    In J. Abello and J. Vitter, editors, External memory algorithms and visualization, volume 50 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 119-130. American Mathematical Society, 1999.

22. Load balancing in the parallelization of the metaheuristic GRASP

    A.C.F. Alvim and C.C. Ribeiro

    Technical report, Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, RJ 22453-900 Brazil, 1998.

23. Heuristics for the phylogeny problem

    A. Andreatta and C.C. Ribeiro

    Journal of Heuristics, 8:429-447, 2002.

24. Parallel strategies for GRASP with path-relinking

    R.M. Aiex and M.G.C. Resende

    Technical report, Internet and Network Systems Research Center, AT&T Labs Research, Florham Park, NJ, 2003.

25. Motif-GRASP and Motif-ILS: Two new stochastic local search algorithms for motif finding

    M. Andronescu and B. Rastegari

    Technical report, Computer Science Department, University of British Columbia, Vancouver, Canada, 2003.

26. O problema de roteamento de veículos e algumas metaheurísticas

    R.G.I. Arakaki

    Master's thesis, Instituto Nacional de Pasquisas Espaciais, Brazil, September 1998.

27. GRASP: An effective constructive technique for VLSI circuit partitioning

    S.M. Areibi

    In Proc. IEEE Canadian Conference on Electrical & Computer Engineering (CCECE'99), volume 1, pages 462-467, May 1999.

28. GRASP with path relinking for the three-index assignment problem

    R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo

    Technical report, AT&T Labs Research, Florham Park, NJ 07733, 2000. To appear in INFORMS J. on Computing.

29. Probability distribution of solution time in GRASP: An experimental investigation

    R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro

    Journal of Heuristics, 8:343-373, 2002.

30. Massive quasi-clique detection

    J. Abello, M.G.C. Resende, and S. Sudarsky

    Lecture Notes in Computer Science, 2286:598-612, 2002.

31. A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy

    J.B. Atkinson

    Journal of the Operational Research Society, 49:700-708, 1998.

32. A GRASP clustering technique for circuit partitioning

    S. Areibi and A. Vannelli

    In J. Gu and P.M. Pardalos, editors, Satisfiability problems, volume 35 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 711-724. American Mathematical Society, 1997.

33. Efficient hybrid search techniques for circuit partitioning

    S. Areibi and A. Vannelli

    In IEEE 4th World Multiconference on Circuits, Systems, Communications & Computers, July 2000.

34. A computational study of heuristic algorithms for two-dimensional cutting stock problems

    R. Alvarez-Valdes, A. Parajon, and J.M. Tamarit

    In Proceedings of MIC'2001, pages 7-11, July 16-20 2001.

35. A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

    R. Alvarez-Valdés, A. Parajón, and J.M. Tamarit

    Computers & Operations Research, 29:925-947, 2002.

36. An analysis of a rail car unloading area for a consumer products manufacturer

    J.F. Bard

    Journal of the Operational Research Society, 48:873-883, 1997.

37. A multistart randomized greedy algorithm for traffic grooming on mesh logical topologies

    M. Brunato and R. Battiti

    Technical report, Department of Mathematics, University of Trento, Trento, Italy, 2001.

38. A visual interactive approach to vehicle routing

    B.M. Baker and C.A.C. Carreto

    Computers and Operations Research, 30:321-337, 2003.

39. Labeling heuristics for orthogonal drawings

    C. Binucci, W. Didimo, G. Liotta, and M. Nonato

    In Proceedings of GD'98 -- Symposium on Graph Drawing, volume 2265 of Lecture Notes in Computer Science, pages 139-153. Springer-Verlag, 2002.

40. Operations sequencing in discrete parts manufacturing

    J.F. Bard and T.A. Feo

    Management Science, 35:249-255, 1989.

41. An algorithm for the manufacturing equipment selection problem

    J.F. Bard and T.A. Feo

    IIE Transactions, 23:83-92, 1991.

42. A GRASP for scheduling printed wiring board assembly

    J.F. Bard, T.A. Feo, and S. Holland

    I.I.E. Trans., 28:155-165, 1996.

43. A decomposition approach to the inventory routing problem with satellite facilities

    J.F. Bard, L. Huang, P. Jaillet, and M. Dror

    Transportation Science, 32:189-203, 1998.

44. A greedy randomized adaptive search procedure for job shop scheduling

    S. Binato, W.J. Hery, D. Loewenstern, and M.G.C. Resende

    In C.C. Ribeiro and P. Hansen, editors, Essays and surveys in metaheuristics, pages 58-79. Kluwer Academic Publishers, 2002.

45. A branch-and-cut procedure for the vehicle routing problem with time windows

    J.F. Bard, G. Kontoravdis, and G. Yu

    Transportation Science, 36:250-269, 2002.

46. A Reactive GRASP for transmission network expansion planning

    S. Binato and G.C. Oliveira

    In C.C. Ribeiro and P. Hansen, editors, Essays and surveys in metaheuristics, pages 81-100. Kluwer Academic Publishers, 2002.

47. A greedy randomized adaptive search procedure for transmission expansion planning

    S. Binato, G.C. Oliveira, and J.L. Araújo

    IEEE Transactions on Power Systems, 16:247-253, 2001.

48. A mixed integer disjunctive model for transmission network expansion

    L. Bahiense, G.C. Oliveira, and M. Pereira

    IEEE Transactions on Power Systems, 16:560-565, 2001.

49. Procedimientos para la localización de áreas de aportación de residuos urbanos

    J. Bautista and J. Pereira

    In 27 Congreso Nacional de Estadística e Investigación Operativa, Lleida, Spain, April 2003.

50. Metaheuristics in combinatorial optimization: Overview and conceptual comparison

    C. Blum and A. Roli

    ACM Computing Surveys, 35(3):268-308, 2003.

51. Randomized algorithms for scene recognition by inexact graph matching

    M.C. Boeres, C.C. Ribeiro, and I. Bloch

    Technical report, Computer Science Department, Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil, 2003.

52. Heuristic-biased stochastic sampling

    J.L. Bresina

    In Proceedings of the AAAI-96, pages 271-278, 1996.

53. Algorithmic methods in genetic mapping

    D.C. Brown

    PhD thesis, Cornell University, Ithaca, NY, USA, 2000.

54. Local search heuristics for the assembly line balancing problem with incompatibilities between tasks

    J. Bautista, R. Suárez, M. Mateo, and R. Companys

    In Proceedings of the IEEE ICRA-00, volume 3, pages 2404-2409, April 2000.

55. Selecting mapping: A discrete optimization approach to select a population subset for use in a high-density genetic mapping project

    D.G. Brown, T.J. Vision, and S.D. Tanksley

    Genetics, 155:407-420, 2000.

56. Estratégias de reinício de busca local baseadas em memória para programação de tarefas em uma máquina

    L.M. Christofoletti and V.A. Armentano

    In Proceedings of te XXXIII Brazilan Symposium on Operations Research, pages 1381-1389, November 6-9 2001.

57. A GRASP interactive approach to the vehicle routing problem with backhauls

    C. Carreto and B. Baker

    In C.C. Ribeiro and P. Hansen, editors, Essays and surveys in metaheuristics, pages 185-200. Kluwer Academic Publishers, 2002.

58. The greedy algorithm and its application to the construction of a continuous speech database

    H. Frac cois and O. Boëffard

    In Proceedings of LREC-2002, volume 5, pages 1420-1426, May 29-31 2002.

59. A greedy randomized adaptive search procedure applied to the clustering problem as an initialization process using K-means as a local search procedure

    J.R. Cano, O. Cordón, F. Herrera, and L. Sánchez

    Journal of Intelligent and Fuzzy Systems, 12:235-242, 2002.

60. A GRASP algorithm for clustering

    J.R. Cano, O. Cordón, F. Herrera, and L. Sánchez

    In F. J. Garijo, J.C. Riquelme, and M. Toro, editors, Advances in Artificial Intelligence - IBERAMIA 2002, 8th Ibero-American Conference on AI, Seville, Spain, November 12-15, 2002, Proceedings, volume 2527 of Lecture Notes in Computer Science, pages 214-223. Springer, 2002.

61. Procedimientos constructivos adaptivos (GRASP) para el problema del empaquetado bidimensional

    J.D.B. Cano, R.J. Cabrera, and J.M.M. Vega

    Revista Iberoamericana de Inteligencia Artificial, 15:26-33, 2002.

62. Métodos de reinício aplicados ao seqüenciamento em uma máquina com tempos de preparac cão e data de entrega

    L.M. Christofoletti

    Master's thesis, Departamento de Engenharia de Sistemas, Universidade Estadual de Campinas, Brazil, April 2002.

63. Mobility management in cellular telephony

    B.P. Cooke, D. Kwon, D. Glotov, S. Schurr, D. Taylor, and T. Wittman

    Technical report, Institute of Mathematics and its Applications, University of Minnesota, USA, 2002.

64. GRASP with a new local search scheme for vehicle routing problems with time windows

    W. Chaovalitwongse, D. Kim, and P.M. Pardalos

    J. of Combinatorial Optimization, 7:179-207, 2003.

65. Incorporating workflow interference in facility layout design: The quartic assignment problem

    W.C. Chiang, P. Kouvelis, and T.L. Urban

    Management Science, 48(4):584-590, 2002.

66. Parallel randomized heuristics for the set covering problem

    M.S. Fiorenzo Catalano and F. Malucelli

    Technical report, Transportation and traffic engineering section, Delft U. of Technology, 2600 AG Delft, The Netherlands, 2000. To appear in International J. of Computer Research.

67. Application of GRASP to the multiconstraint knapsack problem

    P. Chardaire, G.P. McKeown, and J.A. Maki

    In E.J.W. Boers et al., editor, EvoWorkshop 2001, pages 30-39. Springer-Verlag Berlin Heidelberg, 2001.

68. A GRASP heuristic for the mixed Chinese postman problem

    A. Corberán, R. Martí, and J.M. Sanchís

    European Journal of Operational Research, 142:70-80, 2002.

69. Local search with perturbation for the prize-collecting Steiner tree problems in graphs

    S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro

    Networks, 38:50-58, 2001.

70. Decision support for consumer direct grocery initiatives

    A.M. Campbell and M. Savelsbergh

    Technical report, Department of Management Sciences, Tippie College of Business, University of Iowa, 2002. Submitted to Transportation Science.

71. Incentive schemes for consumer direct delivery

    A.M. Campbell and M. Savelsbergh

    Technical report, Department of Management Sciences, Tippie College of Business, University of Iowa, 2003. Submitted to Transportation Science.

72. GRASPing the examination scheduling problem

    S. Casey and J. Thompson

    In E. Burke and P. De Causmaecker, editors, PATAT 2002, volume 2740 of Lecture Notes in Computer Science, pages 232-244. Springer, 2003.

73. Local search methods for learning Bayesian networks using a modified neighborhood in the space of DAGs

    L.M. de Campos, J.<. Fernández-Luna, and J.M. Puerta

    In F. J. Garijo, J.C. Riquelme, and M. Toro, editors, Advances in Artificial Intelligence - IBERAMIA 2002, 8th Ibero-American Conference on AI, Seville, Spain, November 12-15, 2002, Proceedings, volume 2527 of Lecture Notes in Computer Science, pages 182-192. Springer, 2002.

74. Comparing new heuristics for the pure integer capacitated plant location problem

    H. Delmaire, J.A. Díaz, E. Fernández, and M. Ortega

    Technical Report DR97/10, Department of Statistics and Operations Research, Universitat Politecnica de Catalunya, Barcelona, Spain, 1997.

75. Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem

    H. Delmaire, J.A. Díaz, E. Fernández, and M. Ortega

    INFOR, 37:194-225, 1999.

76. Subset selection in multiple linear regression: A new mathematical programming approach

    R. Demirer and B. Eksioglu

    Technical Report School of business working paper no. 284, School of business, University of Kansas, Lawrence, Kansas, USA, 1998.

77. GRASP for set packing problems

    X. Delorme, X. Gandibleux, and J. Rodriguez

    In Proceedings of the Operational Research Peripatetic Post-Graduate Programme (ORP3), September 26-29 2001.

78. GRASP for set packing problems

    X. Delorme, X. Gandibleux, and J. Rodriguez

    European J. of Operational Research, 153(3):564-580, 2004.

79. Solving a generalized model for CON due date assignment and sequencing

    P. De, J.B. Ghosj, and C.E. Wells

    International Journal of Production Economics, 34:179-185, 1994.

80. Algoritmos e estratégias de soluc cão para o problema do gerenciamento de sondas de produc cão terrestre na bacia petrolífera potiguar

    T. Ferreira de Noronha

    Revista Electr^onica de Iniciac cão Cientifica, 1, 2001.

81. Heuristics for railway infrastructure saturation

    X. Delorme, J. Rodriguez, and X. Gandibleux

    In Christos Zaroliagis, editor, Electronic Notes in Theoretical Computer Science, volume 50. Elsevier, 2001.

82. A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy

    M.C. de Souza, C. Duhamel, and C.C. Ribeiro

    In M.G.C. Resende and J.P. de Sousa, editors, Metaheuristics: Computer decision-making, pages 627-658. Kluwer Academic Publishers, 2003.

83. Integrating heuristics and spatial databases: A case study

    C. Carvalho de Souza, C. Bauzer Medeiros, and R. Scachetti Pereira

    Technical Report IC-96-18, Institute of Computing, Universidade Estadual de Campinas, Campinas, Brazil, 1996.

84. A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions

    A.S. Deshpande and E. Triantaphyllou

    Mathematical and Computer Modelling, 27:75-99, 1998.

85. Un modelo tipo GRASP para la paralelización de algoritmos en computadoras MIMD: Aplicación al algoritmo de Jarmenson

    J.C.Z. Diaz, J.S. Velázquez, and J.F. Solis

    Technical report, Universidad Autónoma del Estado de Morelos, Facultad de Ciencias, Cuernavaca, Morelos, Mexico, 1999.

86. The cutting path and tool selection problem in computer-aided process planning

    T.A. Feo and J.F. Bard

    Journal of Manufacturing Systems, 8:17-26, 1989.

87. Flight scheduling and maintenance base planning

    T.A. Feo and J.F. Bard

    Management Science, 35:1415-1432, 1989.

88. Facility-wide planning and scheduling of printed wiring board assembly

    T.A. Feo, J.F Bard, and S. Holland

    Operations Research, 43:219-230, 1995.

89. Power transmission network design by greedy randomized adaptive path relinking

    H. Faria Jr., S. Binato, M.G.C. Resende, and D.M. Falc ao

    IEEE Transactions on Power Systems, 2004, To appear.

90. Greedy randomized adaptive search procedures

    P. Festa

    AIROnews, 7(4):7-11, 2003.

91. Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory

    C. Fleurent and F. Glover

    INFORMS Journal on Computing, 11:198-204, 1999.

92. The intermodal trailer assignment problem: Models, algorithms, and heuristics

    T.A. Feo and J.L González-Velarde

    Transportation Science, 29:330-341, 1995.

93. The footprint sorting problem

    C. Fried, W. Hordijk, S.J. Prohaska, C.R. Stradler, and P.F. Stradler

    Technical report, Bioinformatics, Department of Computer Science, University of Leipzig, Germany, 2003.

94. GRASP for seam drawing in mosaicking of aerial photographic maps

    E. Fernández and R. Martí

    Journal of Heuristics, 5:181-197, 1999.

95. Algorithm 815: FORTRAN subroutines for computing approximate solution to feedback set problems using GRASP

    P. Festa, P.M. Pardalos, and M.G.C. Resende

    ACM Transactions on Mathematical Software, 27:456-464, 2001.

96. Randomized heuristics for the MAX-CUT problem

    P. Festa, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro

    Optimization Methods and Software, 7:1033-1058, 2002.

97. A probabilistic heuristic for a computationally difficult set covering problem

    T.A. Feo and M.G.C. Resende

    Operations Research Letters, 8:67-71, 1989.

98. Greedy randomized adaptive search procedures

    T.A. Feo and M.G.C. Resende

    Journal of Global Optimization, 6:109-133, 1995.

99. GRASP in switching input optimal control synthesis

    P. Festa and G. Raiconi

    In Proceedings of MIC'2001, pages 381-385, July 16-20 2001.

100. GRASP: An annotated bibliography

     P. Festa and M.G.C. Resende

     In C.C. Ribeiro and P. Hansen, editors, Essays and surveys in metaheuristics, pages 325-367. Kluwer Academic Publishers, 2002.

101. A greedy randomized adaptive search procedure for maximum independent set

     T.A. Feo, M.G.C. Resende, and S.H. Smith

     Operations Research, 42:860-878, 1994.

102. A GRASP for single machine scheduling with sequence dependent setup costs and linear delay penalties

     T.A. Feo, K. Sarathy, and J. McGahan

     Computers & Operations Research, 23:881-895, 1996.

103. A GRASP for a difficult single machine scheduling problem

     T.A. Feo, K. Venkatraman, and J.F. Bard

     Computers & Operations Research, 18:635-643, 1991.

104. Algorithmic approaches for the single source capacitated plant location problem

     J.A. Díaz García

     PhD thesis, Departamento d'Estadística i Investigació Operativa, Univarsitat Politécnica de Catalunya, Barcelona, Spain, 2001.

105. An experimental evaluation of the GRASP metaheuristic applied to the uncapacitated location problem

     M.J.N. Gomes and J.B.C. da Silva

     Technical Report 004/99, Department of Statistics and Computation, State University of Ceará, Fortaleza, Ceará, Brazil, 1999.

106. Computational aspects of the maximum diversity problem

     J.B. Ghosh

     Operations Research Letters, 19:175-181, 1996.

107. A comparison of GRASP and an exact method for solving a production and delivery scheduling problem

     J.M. García, S. Lozano, K. Smith, and F. Guerrero

     In First International Workshop on Hybrid Intelligent Systems (HIS'01), Adelaide, Australia, December 2001.

108. A GRASP approach to the nesting problem

     A.M. Gomes and J.F. Oliveira

     In Proceedings of MIC'2001, pages 47-52, July 16-20 2001.

109. GRASP

     J.L. González

     In A. Díaz, editor, Heuristic optimization and neural networks in operations management and engineering, pages 143-161. Editorial Paraninfo, Madrid, 1996.

110. Diversification strategies in local search for a nonbifurcated network loading problem

     B. Gendron, J.-Y. Potvin, and P. Soriano

     European Journal of Operational Research, 142(2):231-241, 2002.

111. A first making use of GRASP for solving MOCO problems

     X. Gandibleux, D. Vancoppenolle, and D. Tuyttens

     Technical report, University of Valenciennes, France, 1998.

112. The vehicle routing problem and local search metaheuristics

     C.A. Hjorring

     PhD thesis, University of Auckland, Auckland, New Zealand, 1995.

113. An introduction to variable neighborhood search

     P. Hansen and N. Mladenovic

     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 Academic Publishers, 1998.

114. Greedy randomized adaptive search for a location problem with economies of scale

     K. Holmqvist, A. Migdalas, and P.M. Pardalos

     In I.M. Bomze et al., editor, Developments in Global Optimization, pages 301-313. Kluwer Academic Publishers, 1997.

115. A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem

     K. Holmqvist, A. Migdalas, and P.M. Pardalos

     In P.M. Pardalos and D.-Z. Du, editors, Network design: Connectivity and facilities location, volume 40 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 131-142. American Mathematical Society, 1998.

116. Maximally disjoint solutions of the set covering problem

     P.L. Hammer and D.J. Rader, Jr.

     Journal of Heuristics, 7:131-144, 2001.

117. Semi-greedy heuristics: An empirical study

     J.P. Hart and A.W. Shogan

     Operations Research Letters, 6:107-114, 1987.

118. Predicting muscle fatique via electromyography: A comparative study

     V.I. Iorvik, E. Triantaphyllou, T.W. Liao, and S.M. Waly

     In Proceedings of the 25th International Conference on Computers and Industrial Engineering, pages 277-280, March 1999.

119. Métaheuristiques pour l'optimisation combinatoire et l'affectation sous contraintes

     H. Jin-Kao, P. Galinier, and M. Habib

     Revue d'Intelligence Artificielle, 13(2):283-324, 2000.

120. A sampling-based heuristic for tree search applied to grammar induction

     H. Juillé and J.B. Pollack

     In Proceedings of the Fifteenth National Conference on Artificial Intelligence, July 26-30 1998.

121. A GRASP for the vehicle routing problem with time windows

     G. Kontoravdis and J.F. Bard

     ORSA Journal on Computing, 7:10-23, 1995.

122. Avoiding local optima in the p-hub location problem using tabu search and GRASP

     J.G. Klincewicz

     Annals of Operations Research, 40:283-302, 1992.

123. Enumeration and search procedures for a hub location problem with economies of scale

     J.G. Klincewicz

     Annals of Operations Research, 110:107-122, 2002.

124. A GRASP approach to the protein structure prediction problem

     N. Krasnogor, D.A. Pelta, W. Russo, and G. Terrazas

     Technical report, LIFIA Lab, University of La Plata, La Plata, Argentina, 1998.

125. Using GRASP to solve the component grouping problem

     J.G. Klincewicz and A. Rajan

     Naval Research Logistics, 41:893-912, 1994.

126. Efficient algorithms for location and sizing problems in network design

     K. Kumaran, A. Srinivasan, Q. Wang, S. Lanning, and K.G. Ramakrishnan

     In Global Telecommunications Conference, 2001 (GLOBECOM '01), volume 4, pages 2586-2590. IEEE, 2001.

127. Server replication and its placement for reliable multicast

     B. Li, F. Chen, and L. Yin

     In Proceedings of the IEEE ICCCN-00, pages 396-401, October 2000.

128. A greedy randomized adaptive search procedure for the two-partition problem

     M. Laguna, T.A. Feo, and H.C. Elrod

     Operations Research, 42:677-687, 1994.

129. A search heuristic for just-in-time scheduling in parallel machines

     M. Laguna and J.L. González-Velarde

     Journal of Intelligent Manufacturing, 2:253-260, 1991.

130. GRASP and path relinking for 2-layer straight line crossing minimization

     M. Laguna and R. Martí

     INFORMS Journal on Computing, 11:44-52, 1999.

131. A GRASP for coloring sparse graphs

     M. Laguna and R. Martí

     Computational Optimization and Applications, 19:165-178, 2001.

132. A class of heuristic methods for the maximization of the l₁-norm over parallelotopes

     M. Locatelli

     Technical report, Dipartimento di Sistemi ed Informatica, Universitá di Firenze, Firenze, Italy, 1998.

133. Multiobjective metaheuristics for the bus-driver scheduling problem

     H.R. Lourenço, J.P. Paixão, and R. Portugal

     Transportation Sciences, 35:331-343, 2001.

134. A greedy randomized adaptive search procedure for the quadratic assignment problem

     Y. Li, P.M. Pardalos, and M.G.C. Resende

     In P.M. Pardalos and H. Wolkowicz, editors, Quadratic assignment and related problems, volume 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 237-261. American Mathematical Society, 1994.

135. A GRASP for frequency assignment in mobile radio networks

     X. Liu, P.M. Pardalos, S. Rajasekaran, and M.G.C. Resende

     In S. Rajasekaran, P.M. Pardalos, and F.Hsu, editors, Mobile Networks and Computing, volume 52 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 195-201. American Mathematical Society, 2000.

136. Adaptive approach heuristics for the generalized assignment problem

     H. R. Lourenço and D. Serra

     Technical Report 288, Department of Economics and Business, Universitat Pompeu Fabra, Barcelona, Spain, 1998.

137. Estratégias de paralelização de metaheurísticas em ambientes de memória distribuída

     S.L. Martins

     PhD thesis, Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil, 1999.

138. Arc crossing minimization in graphs with GRASP

     R. Martí

     IIE Transactions, 33:913-919, 2001.

139. The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations

     E.M. Macambira and C.C. de Souza

     Technical Report IC-97-14, Instituto de Computac cão, Universidade Estadual de Campinas, Campinas, Brazil, 1997.

140. A GRASP for the maximum clique problem with weighted edges

     E.M. Macambira and C.C. de Souza

     In Proceedings of the XXIX Brazilian Symposium on Operations Research, page 70, October 1997.

141. Incremental bipartite drawing problem

     R. Martí and V. Estruch

     Computers and Operations Research, 28:1287-1298, 2001.

142. Bayesian discrete and global optimization

     J. Mockus, E. Eddy, A. Mockus, L. Mockus, and G.V. Reklaitis

     Kluwer Academic Publishers, 1997.

143. Heuristic methods for topological design of telecomminication networks

     A. Myslek and P. Karas

     In Proceedings of PGTS 2002, 2002.

144. Heuristics and meta-heuristics for 2-layer straight line crossing minimization

     R. Martí and M. Laguna

     Discrete Applied Mathematics, 127:665-678, 2003.

145. A GRASP algorithm for the maximum weighted edge subgraph problem

     E.M. Macambira and C.N. Meneses

     Technical report, Department of Statistics and Computation, University of Ceará, Fortaleza, CE 60740-000 Brazil, 1998.

146. Expading neighborhood GRASP for the Traveling Salesman Problem

     Y. Marinakis and A. Migdalas

     Technical report, Technical University of Crete, Chania 73100, Greece, 2003.

147. GRASP metaheuristics to the generalized covering tour problem

     L. Motta, L.S. Ochi, and C. Martinhon

     In Proceedings of MIC'2001, pages 387-391, July 16-20 2001.

148. Um algoritmo GRASP para o problema de transporte de derivados de petróleo em oleodutos

     R.L. Milidíu, A.A. Pessoa, V. Braconi, E.S. Laber, and Rey P.A

     In Proceedings of te XXXIII Brazilan Symposium on Operations Research, pages 237-246, November 6-9 2001.

149. A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem

     R.A. Murphey, P.M. Pardalos, and L.S. Pitsoulis

     In P.M. Pardalos and D.-Z. Du, editors, Network design: Connectivity and facilities location, volume 40 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 277-301. American Mathematical Society, 1998.

150. A parallel GRASP for the data association multidimensional assignment problem

     R.A. Murphey, P.M. Pardalos, and L.S. Pitsoulis

     In P.M. Pardalos, editor, Parallel Processing of Discrete Problems, volume 106 of The IMA Volumes in Mathematics and its Applications, pages 159-180. Springer-Verlag, 1998.

151. A GRASP for the biquadratic assignment problem

     T. Mavridou, P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende

     European Journal of Operational Research, 105:613-621, 1998.

152. Greedy randomized adaptive search procedures for the Steiner problem in graphs

     S.L. Martins, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro

     In P.M. Pardalos, S. Rajasekaran, and J. Rolim, editors, Randomization methods in algorithmic design, volume 43 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 133-145. American Mathematical Society, 1999.

153. Modeling modern multimedia traffic

     P. Mahey and C.C. Ribeiro

     Annals of Operations Research, 110:107-122, 2002.

154. A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy

     S.L. Martins, M.G.C. Resende, C.C. Ribeiro, and P.M. Pardalos

     Journal of Global Optimization, 17:267-283, 2000.

155. A parallel GRASP for the Steiner problem in graphs

     S.L. Martins, C.C. Ribeiro, and M.C. Souza

     In A. Ferreira and J. Rolim, editors, Proceedings of IRREGULAR'98 -- 5th International Symposium on Solving Irregularly Structured Problems in Parallel, volume 1457 of Lecture Notes in Computer Science, pages 285-297. Springer-Verlag, 1998.

156. Piecewise linear time series estimation with GRASP

     M.C. Medeiros, M.G.C. Resende, and A. Veiga

     Computational Optimization and Applications, 19:127-144, 2001.

157. A combinatorial approach to piecewise linear time analysis

     M.C. Medeiros, A. Veiga, and M.G.C. Resende

     Journal of Computational and Graphical Statistics, 11:236-258, 2002.

158. Greedy randomised adaptive search procedures (GRASP) for topological design of MPLS networks

     A. Myslek

     In Proceedings of the 8th Polish Teletraffic Symposium, 2001.

159. GRASP for linear integer programming

     T. Neto and J.P. Pedroso

     In Proceedings of MIC'2001, pages 377-380, July 16-20 2001.

160. GRASP for linear integer programming

     T. Neto and J.P. Pedroso

     In M.G.C. Resende and J.P. de Sousa, editors, Metaheuristics: Computer decision-making, pages 545-574. Kluwer Academic Publishers, 2003.

161. Automatic bounding volume hierarchy generation using stochastic search methods

     K. Ng and B. Trifonov

     In CPSC532D Mini-Workshop "Stochastic Search Algorithms", April 2003.

162. A greedy random adaptive search procedure for the maximal planar graph problem

     I.H. Osman, B. Al-Ayoubi, and M. Barake

     Computers and Industrial Engineering, 45:635-651, 2003.

163. A greedy random adaptive search procedure for the weighted maximal planar graph problem

     I.H. Osman, B. Al-Ayoubi, M. Barake, and M. Hasan

     Technical report, School of Business and Center for Advanced Mathematical Sciences, American University of Beirut, Beirut, Lebanon, 2000.

164. Two metaheuristics for channel allocation in mobile telephony

     C.A.S. Oliveira and F.C. Gomes

     Technical report, Artificial Intelligence Laboratory, Universidade Federal do Ceará, Fortaleza, Brazil, August 1999.

165. Linear programming based meta-heuristics for the weighted maximal planar graph

     I.H. Osman, M. Hasan, and A. Abdullah

     Journal of the Operational Research Society, 53:1142-1149, 2002.

166. GRASP with path-relinking for the QAP

     C.A. Oliveira, P.M. Pardalos, and M.G.C. Resende

     In T. Ibaraki and Y. Yoshitomi, editors, Proceedings of the Fifth Metaheuristics International Conference (MIC2003), pages 57-1 -- 57-6, 2003.

167. GRASP with path-relinking the the quadratic assignment problem

     C.A.S. Oliveira, P.M. Pardalos, and M.G.C. Resende

     Lecture Notes in Computer Science, 2004, To appear.

168. A greedy randomized adaptive search procedure for the multi-criteria radio link frequency assignment problem

     E.L. Pasiliao

     Technical report, Department of ISE, University of Florida, Gainesville, FL 32611-6595, 1998.

169. Algorithms for nonlinear assignment problems

     L.S. Pitsoulis

     PhD thesis, Department of Industrial and Systems Engineering, University of Florida, 1999.

170. Design techniques for SDH mesh-restorable networks

     F. Poppe, M. Pickavet, P. Arijs, and P. Demeester

     In Proceedings of the European Conference on Networks and Optical Communications (NOC'97), Volume 2: Core and ATM Networks, pages 94-101, 1997.

171. GRASP and path relinking for the matrix bandwidth minimization

     E. Piñana, I. Plana, V. Campos, and R. Martí

     European J. of Operational Research, 153(1):200-210, 2004.

172. Approximate solutions to the turbine balancing problem

     L.S. Pitsoulis, P.M. Pardalos, and D.W. Hearn

     European J. of Operational Research, 130:147-155, 2001.

173. Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing and GRASP

     P.M. Pardalos, L. Pitsoulis, T. Mavridou, and M.G.C. Resende

     In A. Ferreira and J. Rolim, editors, Parallel Algorithms for Irregularly Structured Problems, Proceedings of the Second International Workshop --Irregular'95, volume 980 of Lecture Notes in Computer Science, pages 317-331. Springer-Verlag, 1995.

174. A parallel GRASP implementation for the quadratic assignment problem

     P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende

     In A. Ferreira and J. Rolim, editors, Parallel Algorithms for Irregularly Structured Problems -- Irregular'94, pages 115-130. Kluwer Academic Publishers, 1995.

175. A parallel GRASP for MAX-SAT problems

     P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende

     Lecture Notes in Computer Science, 1184:575-585, 1996.

176. Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP

     P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende

     ACM Transactions on Mathematical Software, 23:196-208, 1997.

177. A greedy randomized adaptive search procedure for the feedback vertex set problem

     P.M. Pardalos, T. Qian, and M.G.C. Resende

     Journal of Combinatorial Optimization, 2:399-412, 1999.

178. Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment

     M. Prais and C.C. Ribeiro

     INFORMS Journal on Computing, 12:164-176, 2000.

179. Variação de par^ametros em procedimentos GRASP

     M. Prais and C.C. Ribeiro

     Investigación Operativa, 9:1-20, 2000.

180. Greedy randomized adaptive search procedures

     L.S. Pitsoulis and M.G.C. Resende

     In P.M. Pardalos and M.G.C. Resende, editors, Handbook of Applied Optimization, pages 178-183. Oxford University Press, 2002.

181. Estratégias de variação de par^ametros em procedimentos GRASP e aplicações

     M. Prais

     PhD thesis, Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil, 2000.

182. An exact parallel algorithm for the maximum clique problem

     P.M. Pardalos, M.G.C. Resende, and J. Rappe

     In R. De Leone, A. Murli, P.M. Pardalos, and G. Toraldo, editors, High performance algorithms and software in nonlinear optimization, pages 279-300. Kluwer Academic Publishers, 1998.

183. Implementation of a variance reduction based lower bound in a branch and bound algorithm for the quadratic assignment problem

     P.M. Pardalos, K.G. Ramakrishnan, M.G.C. Resende, and Y. Li

     SIAM Journal on Optimization, 7:280-294, 1997.

184. GRASP implementations for the unconstrained binary quadratic optimization problem

     G. Palubeckis and A. Tomkevicius

     Information Technology and Control, 24:14-20, 2002.

185. Design of hybrids for the minimum sum-of-squares clustering problem

     J. Pacheco and O. Valencia

     Computational Statistics and Data Analysis, 43:235-248, 2003.

186. GRASP para o PQA: Um limite de aceitação para soluções iniciais

     M.C. Rangel, N.M.M. Abreu, and P.O. Boaventura Netto

     Pesquisa Operacional, 20:45-58, 2000.

187. A GRASP for parallel machine scheduling with time windows

     S. Rojanasoonthon and J.F. Bard

     INFORMS Journal on Computing, 2004, To appear.

188. Algorithms for parallel machine scheduling: A case study of the tracking and data relay satellite system

     S. Rojanasoonthon, J.F. Bard, and S.D. Reddy

     Journal of the Operational Research Society, 54:806-821, 2003.

189. A modified local search for GRASP in the quadratic assignment problem

     M.C. Rangel, N.M.M. de Abreu, P.O. Boaventura Netto, and M.C.S. Boeres

     Technical report, Production Engineering Program, COPPE, Federal University of Rio de Janeiro, Rio de Janeiro, RJ Brazil, 1998.

190. Algorithms for identification key generation and optimization with application to yeast identification

     A.P. Reynolds, J.L. Dicks, I.N. Roberts, J.J. Wesselink, B. de la Iglesia, V. Robert, T. Boekhout, and V.J. Rayward-Smith

     In Applications of Evolutionary Computing, volume 2611 of Lecture Notes in Computer Science, pages 107-118. Springer-Verlag, 2003.

191. Computing approximate solutions of the maximum covering problem using GRASP

     M.G.C. Resende

     Journal of Heuristics, 4:161-171, 1998.

192. Greedy randomized adaptive search procedures (GRASP)

     M.G.C. Resende

     In C.A. Floudas and P.M. Pardalos, editors, Encyclopedia of Optimization, volume 2, pages 373-382. Kluwer Academic Publishers, 2001.

193. A GRASP for satisfiability

     M.G.C. Resende and T.A. Feo

     In D.S. Johnson and M.A. Trick, editors, Cliques, Coloring, and Satisfiability: The Second DIMACS Implementation Challenge, volume 26 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 499-520. American Mathematical Society, 1996.

194. Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP

     M.G.C. Resende, T.A. Feo, and S.H. Smith

     ACM Transactions on Mathematical Software, 24:386-394, 1998.

195. GRASP: Une métaheuristique gloutone et probabiliste

     C.C. Ribeiro

     In J. Teghem and M. Pirlot, editors, Optimisation approchée en recherche opérationnelle, pages 153-176. Hermès, 2002.

196. Evaluation of parallel implementations of heuristics for the course scheduling problem

     L.I.D. Rivera

     Master's thesis, Instituto Tecnologico y de Estudios Superiores de Monterrey, Monterrey, Mexico, 1998.

197. MAGMA: A multiagent architecture for metaheuristics

     A. Roli and M. Milano

     Technical Report DEIS-LIA-02-007, DEIS, Università degli Studi di Bologna, Bologna, Italy, 2002.

198. Heuristics for the flow line problem with setup costs

     R.Z. Ríos-Mercado and J.F. Bard

     European Journal of Operational Research, pages 76-98, 1998.

199. A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem

     A.J. Robertson

     Computational Optimization and Applications, 19:145-164, 2001.

200. Heurísticas para o problema de síntese de redes a 2-caminhos

     I.C.M. Rosseti

     PhD thesis, Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil, July 2003.

201. Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP

     M.G.C. Resende, P.M. Pardalos, and Y. Li

     ACM Transactions on Mathematical Software, 22:104-118, 1996.

202. Approximate solution of weighted MAX-SAT problems using GRASP

     M.G.C. Resende, L.S. Pitsoulis, and P.M. Pardalos

     In J. Gu and P.M. Pardalos, editors, Satisfiability problems, volume 35 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 393-405. American Mathematical Society, 1997.

203. Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP

     M.G.C. Resende, L.S. Pitsoulis, and P.M. Pardalos

     Discrete Applied Mathematics, 100:95-113, 2000.

204. A GRASP for graph planarization

     M.G.C. Resende and C.C. Ribeiro

     Networks, 29:173-189, 1997.

205. A GRASP for frame relay PVC routing

     L.I.P. Resende and M.G.C. Resende

     In Proc. of the Third Metaheuristics International Conference, pages 397-402, July 1999.

206. Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP

     C.C. Ribeiro and M.G.C. Resende

     ACM Transactions on Mathematical Software, 25:341-352, 1999.

207. A parallel GRASP for the 2-path network design problem

     C.C. Ribeiro and I. Rosseti

     Lecture Notes in Computer Science, 2004:922-926, 2002.

208. GRASP and path-relinking: Recent advances and applications

     M.G.C. Resende and C.C. Ribeiro

     In T. Ibaraki and Y. Yoshitomi, editors, Proceedings of the Fifth Metaheuristics International Conference (MIC2003), pages T6-1 -- T6-6, 2003.

209. GRASP and path-relinking: Recent advances and applications

     M.G.C. Resende and C.C. Ribeiro

     Technical report, Internet and Network Systems Research Center, AT&T Labs Research, Florham Park, NJ, 2003.

210. GRASP with path-relinking for private virtual circuit routing

     M.G.C. Resende and C.C. Ribeiro

     Networks, 41:104-114, 2003.

211. Greedy randomized adaptive search procedures

     M.G.C. Resende and C.C. Ribeiro

     In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 219-249. Kluwer Academic Publishers, 2003.

212. SMART: A tool for AT&T Worldnet access design -- Location of Cascade 9000 concentrators

     M.G.C. Resende and O. Ulular

     Technical report, AT&T Labs Research, Florham Park, NJ 07932 USA, 1997.

213. A hybrid GRASP with perturbations for the Steiner problem in graphs

     C.C. Ribeiro, E. Uchoa, and R.F. Werneck

     INFORMS Journal on Computing, 14:228-246, 2002.

214. GRASP: Procedimientos de búsqueda miope aleatorizado y adaptativo (GRASP: Greedy randomized adaptive search procedures)

     M.G.C. Resende and J.L. González Velarde

     Inteligencia Artificial, 2:61-76, 2003.

215. A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure

     C.C. Ribeiro and D.S. Vianna

     Technical report, Department of Computer Science, Catholic U. of Rio de Janeiro, Rio de Janeiro, Brazil, 2003.

216. A hybrid multistart heuristic for the uncapacitated facility location problem

     M.G.C. Resende and R.F. Werneck

     Technical report, Internet and Network Systems Research Center, AT&T Labs Research, Florham Park, NJ, 2003. Submitted to European J. of Operational Research.

217. A hybrid heuristic for the p-median problem

     M.G.C. Resende and R.F. Werneck

     Journal of Heuristics, 10:59-88, 2004.

218. Consumer choice in competitive location models: Formulations and heuristics

     D. Serra and R. Colomé

     Papers in Regional Science, 80:439-464, 2001.

219. Heuristic constraint propagation using local search for incomplete pruning and domain filtering of reduntant constraints for the social golfer problem

     M. Sellmann and W. Harvey

     In CPAIOR 2002), 2002.

220. GRASP -- Uma heuristíca para resolução de problemas de otimização combinatoria

     C.M.D. Silveira

     Technical report, Institute of Informatics, Federal University of Rio Grande do Sul, Porto Alegre, RS, Brazil, 1999.

221. A GRASP-tabu search algorithm for school timetabling problems

     M.J.F. Souza, N. Maculan, and L.S. Ochi

     In M.G.C. Resende and J.P. de Sousa, editors, Metaheuristics: Computer decision-making, pages 659-672. Kluwer Academic Publishers, 2003.

222. Experimental comparision of greedy randomized adaptive search procedures for the maximum diversity problem

     G.C. Silva, L.S. Ochi, and S.L. Martins

     Technical report, Department of Computer Science, Federal Fluminense University, Niterói, Brazil, 2003.

223. Optimization of a simplified fleet assignment problem with metaheuristics: Simulated annealing and GRASP

     D. Sosnowska

     In P.M. Pardalos, editor, Approximation and complexity in numerical optimization. Kluwer Academic Publishers, 2000.

224. Optimal design of signaling networks for Internet telephony

     A. Srinivasan, K.G. Ramakrishnan, K. Kumaram, M. Aravamudam, and S. Naqvi

     In IEEE INFOCOM 2000, March 2000.

225. Locating emergency services with priority rules: The priority queuing covering location problem

     F. Silva and D. Serra

     Technical Report 1, Research group in management logistics, Department of Economics and Business, Universitat Pompeu Fabra, Barcelona, Spain, 2002.

226. The integrated machine allocation and layout problem

     T.L. Urban, W.-C. Chiang, and R.A. Russel

     International Journal of Production Research, 38:2911-2930, 2000.

227. Solution procedures for the dynamic facility layout problem

     T.L. Urban

     Annals of Operations Research, pages 323-342, 1998.

228. Using GRASP to solve the unit commitment problem

     A. Viana, J.P. de Sousa, and M. Matos

     Annals of Operations Research, 120:117-132, 2003.

229. Initialisation des circuits séquentiels avant test intégré et scan partiel

     I. Vogel, M.-L. Flottes, and C. Landrault

     Technical report, Laboratoire d'Informatique, de Robotique et de Micro-électronique de Montpellier, Montpellier, France, 2002.

230. Uma nova estratégia para aplicação do GRASP ao problema de alocação de canal

     C.E.C. Vieira and P.R.L. Gondim

     Technical Report 070/DE9/01, Departamento de Engenharia de Sistemas, Instituto Militar de Engenharia, Rio de Janeiro, Brazil, 2001.

231. Solving a real-world field technician scheduling problem

     J. Xu and S. Chiu

     In Proceedings of the International Conference on Management Science and the Economic Development of China, pages 240-248, July 1996.

232. Effective heuristic procedure for a field technician scheduling problem

     J. Xu and S. Chiu

     Journal of Heuristics, 7:495-509, 2001.

233. Constraint solving for inkjet print mask design

     J. Yen, M. Carlsson, M. Chang, J.M. Garcia, and H. Nguyen

     Journal of Imaging Science and Technology, 44:391-397, 2000.

234. Genetic and local search algorithms as robust and simple optimization tools

     M. Yagiura and T. Ibakari

     In Meta-heuristics: Theory and applications, pages 63-82. Kluwer Academic Publishers, 1996.

235. A heuristic for mining association rules in polynomial time

     E. Yilmaz, E. Triantaphyllou, J. Chen, and T.W. Liao

     Mathematical and Computer Modelling, 37:219-233, 2003.