IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v42y1994i5p860-878.html
   My bibliography  Save this item

A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Herrán, Alberto & Manuel Colmenar, J. & Duarte, Abraham, 2021. "An efficient variable neighborhood search for the Space-Free Multi-Row Facility Layout problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 893-907.
  2. Jan Mikula & Miroslav Kulich, 2022. "Solving the traveling delivery person problem with limited computational time," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(4), pages 1451-1481, December.
  3. A J Higgins & L A Laredo, 2006. "Improving harvesting and transport planning within a sugar value chain," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(4), pages 367-376, April.
  4. Aymeric Blot & Marie-Éléonore Kessaci & Laetitia Jourdan, 2018. "Survey and unification of local search techniques in metaheuristics for multi-objective combinatorial optimisation," Journal of Heuristics, Springer, vol. 24(6), pages 853-877, December.
  5. Yogesh K. Agarwal, 2002. "Design of Capacitated Multicommodity Networks with Multiple Facilities," Operations Research, INFORMS, vol. 50(2), pages 333-344, April.
  6. Celso Ribeiro & Isabel Rosseti & Reinaldo Vallejos, 2012. "Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms," Journal of Global Optimization, Springer, vol. 54(2), pages 405-429, October.
  7. Sánchez-Oro, J. & López-Sánchez, A.D. & Hernández-Díaz, A.G. & Duarte, A., 2022. "GRASP with strategic oscillation for the α-neighbor p-center problem," European Journal of Operational Research, Elsevier, vol. 303(1), pages 143-158.
  8. Colombi, Marco & Mansini, Renata & Savelsbergh, Martin, 2017. "The generalized independent set problem: Polyhedral analysis and solution approaches," European Journal of Operational Research, Elsevier, vol. 260(1), pages 41-55.
  9. Fernando Stefanello & Vaneet Aggarwal & Luciana S. Buriol & Mauricio G. C. Resende, 2019. "Hybrid algorithms for placement of virtual machines across geo-separated data centers," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 748-793, October.
  10. Drexl, Andreas & Salewski, Frank, 1996. "Distribution Requirements and Compactness Constraints in School Timetabling. Part II: Methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 384, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  11. Duarte, Abraham & Martí, Rafael & Álvarez, Ada & Ángel-Bello, Francisco, 2012. "Metaheuristics for the linear ordering problem with cumulative costs," European Journal of Operational Research, Elsevier, vol. 216(2), pages 270-277.
  12. Lei, Ting L. & Church, Richard L., 2015. "On the unified dispersion problem: Efficient formulations and exact algorithms," European Journal of Operational Research, Elsevier, vol. 241(3), pages 622-630.
  13. Andreas Schirmer, 2000. "Case‐based reasoning and improved adaptive search for project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(3), pages 201-222, April.
  14. A. D. López-Sánchez & J. Sánchez-Oro & M. Laguna, 2021. "A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 629-642, May.
  15. Serigne Gueye & Philippe Michelon, 2005. "“Miniaturized” Linearizations for Quadratic 0/1 Problems," Annals of Operations Research, Springer, vol. 140(1), pages 235-261, November.
  16. Charles Fleurent & Fred Glover, 1999. "Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 198-204, May.
  17. Mario Pavone & Giuseppe Narzisi & Giuseppe Nicosia, 2012. "Clonal selection: an immunological algorithm for global optimization over continuous spaces," Journal of Global Optimization, Springer, vol. 53(4), pages 769-808, August.
  18. Sebastian Lamm & Peter Sanders & Christian Schulz & Darren Strash & Renato F. Werneck, 2017. "Finding near-optimal independent sets at scale," Journal of Heuristics, Springer, vol. 23(4), pages 207-229, August.
  19. Salewski, Frank & Bartsch, Thomas, 1994. "A comparison of genetic and greedy randomized algorithms for medium-to-short-term audit-staff scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 356, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  20. Eduardo G. Pardo & Mauricio Soto & Christopher Thraves, 2015. "Embedding signed graphs in the line," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 451-471, February.
  21. Xu Wang & Guohua Gan & Ling-Yun Wu, 2020. "Framework and algorithms for identifying honest blocks in blockchain," PLOS ONE, Public Library of Science, vol. 15(1), pages 1-14, January.
  22. Coelho, V.N. & Grasas, A. & Ramalhinho, H. & Coelho, I.M. & Souza, M.J.F. & Cruz, R.C., 2016. "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints," European Journal of Operational Research, Elsevier, vol. 250(2), pages 367-376.
  23. Parreño, Francisco & Pacino, Dario & Alvarez-Valdes, Ramon, 2016. "A GRASP algorithm for the container stowage slot planning problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 141-157.
  24. Warren Hare & Jason Loeppky & Shangwei Xie, 2018. "Methods to compare expensive stochastic optimization algorithms with random restarts," Journal of Global Optimization, Springer, vol. 72(4), pages 781-801, December.
  25. Böttcher, Jan & Drexl, Andreas & Kolisch, Rainer & Salewski, Frank, 1996. "Project scheduling under partially renewable resource constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 398, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  26. Raúl Martín-Santamaría & Ana D. López-Sánchez & María Luisa Delgado-Jalón & J. Manuel Colmenar, 2021. "An Efficient Algorithm for Crowd Logistics Optimization," Mathematics, MDPI, vol. 9(5), pages 1-19, March.
  27. J. Terán-Villanueva & Héctor Fraire Huacuja & Juan Carpio Valadez & Rodolfo Pazos Rangel & Héctor Puga Soberanes & José Martínez Flores, 2015. "A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems," Computational Optimization and Applications, Springer, vol. 62(3), pages 787-814, December.
  28. Schirmer, Andreas & Riesenberg, Sven, 1997. "Parameterized heuristics for project scheduling: Biased random sampling methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 456, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  29. Figueiredo, Rosa & Frota, Yuri, 2014. "The maximum balanced subgraph of a signed graph: Applications and solution approaches," European Journal of Operational Research, Elsevier, vol. 236(2), pages 473-487.
  30. Kimms, Alf & Drexl, Andreas, 1996. "Proportional lot sizing and scheduling: Some extensions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 407, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  31. Colmenar, J. Manuel & Greistorfer, Peter & Martí, Rafael & Duarte, Abraham, 2016. "Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem," European Journal of Operational Research, Elsevier, vol. 252(2), pages 432-442.
  32. M. T. Alonso & R. Alvarez-Valdes & F. Parreño, 2020. "A GRASP algorithm for multi container loading problems with practical constraints," 4OR, Springer, vol. 18(1), pages 49-72, March.
  33. Panos M. Pardalos & Tianbing Qian & Mauricio G.C. Resende, 1998. "A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem," Journal of Combinatorial Optimization, Springer, vol. 2(4), pages 399-412, December.
  34. El-Ghazali Talbi, 2016. "Combining metaheuristics with mathematical programming, constraint programming and machine learning," Annals of Operations Research, Springer, vol. 240(1), pages 171-215, May.
  35. Sacramento Quintanilla & Francisco Ballestín & Ángeles Pérez, 2020. "Mathematical models to improve the current practice in a Home Healthcare Unit," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 43-74, March.
  36. Martí, Rafael & Campos, Vicente & Resende, Mauricio G.C. & Duarte, Abraham, 2015. "Multiobjective GRASP with Path Relinking," European Journal of Operational Research, Elsevier, vol. 240(1), pages 54-71.
  37. Alejandra Casado & Sergio Pérez-Peló & Jesús Sánchez-Oro & Abraham Duarte, 2022. "A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem," Journal of Heuristics, Springer, vol. 28(1), pages 121-146, February.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.