GRASP bibliography: Location and layout

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

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

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

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

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

6. Efficient hybrid search techniques for circuit partitioning

   S. Areibi and A. Vannelli

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

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

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

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

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

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

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

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

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

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

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

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

    J.G. Klincewicz

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

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

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

20. A hybrid heuristic for the p-median problem

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

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

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

    D. Serra and R. Colomé

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

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

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

24. Solution procedures for the dynamic facility layout problem

    T.L. Urban

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