IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v31y1987i1p85-93.html

An algorithm for set covering problem

Citations

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


Cited by:

  1. Larry W. Jacobs & Michael J. Brusco, 1995. "Note: A local‐search heuristic for large set‐covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(7), pages 1129-1140, October.
  2. Naji-Azimi, Zahra & Toth, Paolo & Galli, Laura, 2010. "An electromagnetism metaheuristic for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 205(2), pages 290-300, September.
  3. J. E. Beasley, 2024. "An optimal algorithm for variable knockout problems," 4OR, Springer, vol. 22(4), pages 419-433, December.
  4. Mauricio Castillo & Ricardo Soto & Broderick Crawford & Carlos Castro & Rodrigo Olivares, 2021. "A Knowledge-Based Hybrid Approach on Particle Swarm Optimization Using Hidden Markov Models," Mathematics, MDPI, vol. 9(12), pages 1-21, June.
  5. El-Darzi, Elia & Mitra, Gautam, 1995. "Graph theoretic relaxations of set covering and set partitioning problems," European Journal of Operational Research, Elsevier, vol. 87(1), pages 109-121, November.
  6. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
  7. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
  8. Christian Prins & Caroline Prodhon & Roberto Calvo, 2006. "Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem," Annals of Operations Research, Springer, vol. 147(1), pages 23-41, October.
  9. İbrahim Miraç Eligüzel & Eren Özceylan & Gerhard-Wilhelm Weber, 2023. "Location-allocation analysis of humanitarian distribution plans: a case of United Nations Humanitarian Response Depots," Annals of Operations Research, Springer, vol. 324(1), pages 825-854, May.
  10. Nonobe, Koji & Ibaraki, Toshihide, 1998. "A tabu search approach to the constraint satisfaction problem as a general problem solver," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 599-623, April.
  11. Hanif D. Sherali & Seong‐In Kim & Edna L. Parrish, 1991. "Probabilistic partial set covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(1), pages 41-51, February.
  12. Stephen E. Bechtold & Larry W. Jacobs, 1996. "The equivalence of general set‐covering and implicit integer programming formulations for shift scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(2), pages 233-249, March.
  13. Alejandro Lara-Caballero & Diego González-Moreno, 2023. "A Population-Based Local Search Algorithm for the Identifying Code Problem," Mathematics, MDPI, vol. 11(20), pages 1-17, October.
  14. Victor Reyes & Ignacio Araya, 2021. "A GRASP-based scheme for the set covering problem," Operational Research, Springer, vol. 21(4), pages 2391-2408, December.
  15. George Kozanidis & Odysseas Moschopoulos, 2025. "Set-cover master problem formulations for maximum flight coverage in branch & price solution algorithms for optimal aircrew rostering," Operational Research, Springer, vol. 25(3), pages 1-34, September.
  16. Helena Ramalhinho-Lourenço, 2001. "The crew-scheduling module in the GIST system," Economics Working Papers 547, Department of Economics and Business, Universitat Pompeu Fabra.
  17. Wang, Yiyuan & Pan, Shiwei & Al-Shihabi, Sameh & Zhou, Junping & Yang, Nan & Yin, Minghao, 2021. "An improved configuration checking-based algorithm for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 294(2), pages 476-491.
  18. Ohlsson, Mattias & Peterson, Carsten & Soderberg, Bo, 2001. "An efficient mean field approach to the set covering problem," European Journal of Operational Research, Elsevier, vol. 133(3), pages 583-595, September.
  19. Alberto Caprara & Matteo Fischetti & Paolo Toth, 1999. "A Heuristic Method for the Set Covering Problem," Operations Research, INFORMS, vol. 47(5), pages 730-743, October.
  20. Grossman, Tal & Wool, Avishai, 1997. "Computational experience with approximation algorithms for the set covering problem," European Journal of Operational Research, Elsevier, vol. 101(1), pages 81-92, August.
  21. Galvao, Roberto D. & Gonzalo Acosta Espejo, Luis & Boffey, Brian, 2000. "A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 124(2), pages 377-389, July.
  22. Ferdinando Pezzella & Enrico Faggioli, 1997. "Solving large set covering problems for crew scheduling," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 5(1), pages 41-59, June.
  23. Fabio Colombo & Roberto Cordone & Guglielmo Lulli, 2015. "A variable neighborhood search algorithm for the multimode set covering problem," Journal of Global Optimization, Springer, vol. 63(3), pages 461-480, November.
  24. Milos Seda & Pavel Seda, 2025. "Coverage Optimization with Balanced Capacitated Fragmentation," Mathematics, MDPI, vol. 13(5), pages 1-24, February.
  25. J. E. Beasley, 1990. "A lagrangian heuristic for set‐covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 151-164, February.
  26. Gao, Chao & Yao, Xin & Weise, Thomas & Li, Jinlong, 2015. "An efficient local search heuristic with row weighting for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 750-761.
  27. Alejandra Casado & Jesús Sánchez-Oro & Anna Martínez-Gavara, 2025. "Heuristics for the weighted total domination problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 33(2), pages 395-436, July.
  28. José García & Gino Astorga & Víctor Yepes, 2021. "An Analysis of a KNN Perturbation Operator: An Application to the Binarization of Continuous Metaheuristics," Mathematics, MDPI, vol. 9(3), pages 1-20, January.
  29. Wanders, Henrico L. T. & Gaalman, Gerard J. C. & Sierksma, Gerard, 2004. "The composition of semi-finished inventories at a solid board plant," European Journal of Operational Research, Elsevier, vol. 155(1), pages 96-111, May.
  30. Olivier Briant & Denis Naddef, 2004. "The Optimal Diversity Management Problem," Operations Research, INFORMS, vol. 52(4), pages 515-526, August.
  31. Balakrishnan, Anantaram. & Magnanti, Thomas L. & Mirchandani, Prakash., 1991. "A dual-based algorithm for multi-level network design," Working papers 3365-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
  32. P N Ram Kumar & T T Narendran, 2011. "On the usage of Lagrangean Relaxation for the convoy movement problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 722-728, April.
  33. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
  34. Nguyen, Tri-Dung, 2014. "A fast approximation algorithm for solving the complete set packing problem," European Journal of Operational Research, Elsevier, vol. 237(1), pages 62-70.
  35. Chunyan Liu & Hejiao Huang & Hongwei Du & Xiaohua Jia, 2017. "Optimal RSUs placement with delay bounded message dissemination in vehicular networks," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1276-1299, May.
  36. Gianpiero Canessa & Julian A. Gallego & Lewis Ntaimo & Bernardo K. Pagnoncelli, 2019. "An algorithm for binary linear chance-constrained problems using IIS," Computational Optimization and Applications, Springer, vol. 72(3), pages 589-608, April.
  37. Torbjörn Larsson & Michael Patriksson, 2006. "Global Optimality Conditions for Discrete and Nonconvex Optimization---With Applications to Lagrangian Heuristics and Column Generation," Operations Research, INFORMS, vol. 54(3), pages 436-453, June.
  38. Mete Suleyman & Cil Zeynel Abidin & Özceylan Eren, 2018. "Location and Coverage Analysis of Bike- Sharing Stations in University Campus," Business Systems Research, Sciendo, vol. 9(2), pages 80-95, July.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.