GRASP bibliography: Covering, packing, and partitioning

  1. 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.

  2. 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.

  3. 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.

  4. Efficient hybrid search techniques for circuit partitioning

    S. Areibi and A. Vannelli

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

  5. 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.

  6. A GRASP algorithm for clustering

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

    In F. J. Garijo, J.C.R. Santos, 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.

  7. 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.

  8. 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.

  9. 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.

  10. GRASP for set packing problems

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

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

  11. 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.

  12. Using GRASP to solve the component grouping problem

    J.G. Klincewicz and A. Rajan

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

  13. 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.

  14. 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.