An algorithm portfolio for the dynamic maximal covering location problem. Calderín, J. F., Masegosa, A. D., & Pelta, D. A. Memetic Computing, 9(2):141–151, Springer Nature, sep, 2017.
An algorithm portfolio for the dynamic maximal covering location problem [link]Paper  doi  bibtex   
@Article{calderin_algorithm_2017,
  author    = {Jenny Fajardo Calder{\'{\i}}n and Antonio D. Masegosa and David A. Pelta},
  title     = {An algorithm portfolio for the dynamic maximal covering location problem},
  journal   = {Memetic Computing},
  year      = {2017},
  volume    = {9},
  number    = {2},
  pages     = {141--151},
  month     = {sep},
  doi       = {10.1007/s12293-016-0210-5},
  groups    = {Journals},
  publisher = {Springer Nature},
  url       = {https://doi.org/10.1007/s12293-016-0210-5},
}

Downloads: 0