Baouche, F., Billot, R., Trigui, R., & El Faouzi, N. E. (2014). Electric vehicle charging stations allocation model.
ROADEF - 15th annual congress of the French society for operational research and decision Aid, Feb 2014, Bordeaux, France. https://hal.archives-ouvertes.fr/hal-00946317/
Bashiri, M., & Yaghoubi, M. R. (2017). The nested hierarchical p-center modeling & solving with PSO algorithm.
Journal of modeling engineering, 14(47), 187-197.
(In Persion). https://doi.org/
10.22075/jme.2017.2478
Bashiri, M., Hajfathaliha, A., & Hejazi, T. H. (2010, January). A simulated annealing algorithm for bi-objective noxious network location problem considering dispersion and total cost.
2010 second international conference on computer modeling and simulation (pp. 194-198). IEEE. https://doi.org/
10.1109/ICCMS.2010.414
Batta, R., Lejeune, M., & Prasad, S. (2014). Public facility location using dispersion, population, and equity criteria.
European journal of operational research, 234(3), 819-829.
https://doi.org/10.1016/j.ejor.2013.10.032
Berman, O., Drezner, Z., & Krass, D. (2011). Discrete cooperative covering problems. Journal of the operational research society, 62(11), 2002-2012. https://doi.org/10.1057/jors.2010.176
Bhattacharya, U. K. (2011). A multi-objective obnoxious facility location model on a plane.
American journal of operations research, 1(2), 39-45. https://doi.org/
10.4236/ajor.2011.12006
Chandu, D. P. (2014). A parallel genetic algorithm for generalized vertex cover problem.
International Journal of Computer Science and Information Technologies (IJCSIT), 5 (6), 7686-7689.
https://arxiv.org/abs/1411.7612
Abdulhalim, M. F., & Bara’a, A. A. (2015). Multi-layer genetic algorithm for maximum disjoint reliable set covers problem in wireless sensor networks.
Wireless personal communications, 80(1), 203-227.
https://doi.org/10.1007/s11277-014-2004-8
Current, J. R., & Storbeck, J. E. (1988). Capacitated covering models.
Environment and planning B: planning and design, 15(2), 153-163.
https://doi.org/10.1068/b150153
Daskin, M. S. (2011). Network and discrete location: models, algorithms, and applications. John Wiley & Sons. https://doi.org/10.1002/9781118537015
Degel, D., & Lutter, P. (2013). A robust formulation of the uncertain set covering problem. Retrieved from http://www.optimization-online.org/DB_FILE/2013/06/3926.pdf
Erkut, E. (1990). The discrete p-dispersion problem. European journal of operational research, 46(1), 48-60. https://doi.org/10.1016/0377-2217(90)90297-O
Gupta, R., & Saxena, R. R. (2014). Fuzzy linear fractional set covering problem with imprecise costs. RAIRO-operations research, 48(3), 415-427. https://doi.org/10.1051/ro/2014015
Hakimpour, F., Talat Ahary, S., & ranjbar, a. (2017). the assessment and Comparison of a Genetic Algorithm, Simulated Annealing and Cuckoo Optimization Algorithm for Optimization of the Facility Location under Competitive Conditions (Case Study: Banks).
Journal of modeling engineering, 15(48), 231-246.
(In Persion).https://doi.org/
10.22075/jme.2017.2447
Hemmati, M., & Smith, J. C. (2016). A mixed-integer bilevel programming approach for a competitive prioritized set covering problem. Discrete optimization, 20, 105-134. https://doi.org/10.1016/j.disopt.2016.04.001
Jacobs, L. W., & Brusco, M. J. (1993). A simulated annealing-based heuristic for the set-covering problem. Proc. “Operations management and information systems department”. Northern Illinois University, Deklab, IL 60115, USA.
Karbasian, M., & Dashti, M. (2011). Designing four multi-objective models for dispersion facilities location problems considering data envelopment analysis and maximum covering.
International journal of management science and engineering management, 6(4), 298-306. https://doi.org/
10.1080/17509653.2011.10671177
Keller, O. H. (1965). [Review of the book
Packing and covering. (Cambridge tracts in mathematics and mathematical physics, No. 54) VIII+ 111 S. Cambridge 1964. At the University Press. Preis geb. 30 s. net. By C. A. Rogers].
ZaMM, 45(6), 450-450.
https://doi.org/10.1002/zamm.19650450620
Lutter, P., Degel, D., Büsing, C., Koster, A. M., & Werners, B. (2017). Improved handling of uncertainty and robustness in set covering problems. European journal of operational research, 263(1), 35-49. https://doi.org/10.1016/j.ejor.2017.04.044
Mokhtari., H. (2017). Modeling and solution of job shop scheduling with no-wait orders to minimize makespan: a decomposition approach based on order sequencing and timetabling.
Journal of modeling engineering, 15(50), 261-270.
(In Persion). https://doi.org/
10.22075/jme.2017.2567
Prokopyev, O. A., Kong, N., & Martinez-Torres, D. L. (2009). The equitable dispersion problem. European journal of operational research, 197(1), 59-67. https://doi.org/10.1016/j.ejor.2008.06.005
Ravi, S. S., Rosenkrantz, D. J., & Tayi, G. K. (1994). Heuristic and special case algorithms for dispersion problems.
Operations research, 42(2), 299-310.
https://doi.org/10.1287/opre.42.2.299
Richter, S., Helmert, M., & Gretton, C. (2007). A stochastic local search approach to vertex cover. In
annual conference on artificial intelligence (pp. 412-426). Springer, Berlin, Heidelberg.
https://doi.org/10.1007/978-3-540-74565-5_31
Sadigh, A. N., Mozafari, M., & Kashan, A. H. (2010). A mixed integer linear program and tabu search approach for the complementary edge covering problem.
Advances in engineering software, 41(5), 762-768.
https://doi.org/10.1016/j.advengsoft.2009.12.017
Song, L., Chen, H., Gu, H., Huang, H., & Du, H. (2015). Set covering in fuel-considered vehicle routing problems. Theoretical computer science, 607, 471-479. https://doi.org/10.1016/j.tcs.2015.06.009
Suletra, I. W., Priyandari, Y., & Jauhari, W. A. (2018). Capacitated set-covering model considering the distance objective and dependency of alternative facilities.
IOP conf. series: materials science and engineering,
319.
10.1088/1757-899X/319/1/012072
Tutunchi, G. K., & Fathi, Y. (2019). Effective methods for solving the Bi-criteria p-Center and p-Dispersion problem.
Computers & operations research, 101, 43-54.
https://doi.org/10.1016/j.cor.2018.08.009
Vieira, B. S., Ferrari, T., Ribeiro, G. M., Bahiense, L., Orrico Filho, R. D., Abramides, C. A., & Júnior, N. F. R. C. (2020). A progressive hybrid set covering based algorithm for the traffic counting location problem.
Expert systems with applications, 160, 113641.
https://doi.org/10.1016/j.eswa.2020.113641