EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

The Cooperative Maximal Covering Location Problem with ordered partial attractions

Concepción Domínguez, Ricardo Gázquez, Juan Miguel Morales, Salvador Pineda

Computers & Operations Research · 2024-10 · 170 · 106782

DOI: 10.1016/j.cor.2024.106782 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computers & Operations Research, 2024-10. Verfasst von Concepción Domínguez und 3 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 49 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: Espana Ministerio de Ciencia e Innovacion, University of Málaga, European Research Council.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Espana Ministerio de Ciencia e Innovacion
  • University of Málaga
  • European Research Council
  • Agencia Estatal de Investigación

Zitieren

APA

Domínguez, C., Gázquez, R., Morales, J. M., & Pineda, S. (2024). The Cooperative Maximal Covering Location Problem with ordered partial attractions. Computers & Operations Research, 170, 106782. https://doi.org/10.1016/j.cor.2024.106782

Vancouver

Domínguez C, Gázquez R, Morales JM, Pineda S. The Cooperative Maximal Covering Location Problem with ordered partial attractions. Computers & Operations Research. 2024;170:106782. doi:10.1016/j.cor.2024.106782

BibTeX
@article{Domnguez2024,
  author = {Domínguez, Concepción and Gázquez, Ricardo and Morales, Juan Miguel and Pineda, Salvador},
  title = {The Cooperative Maximal Covering Location Problem with ordered partial attractions},
  journal = {Computers & Operations Research},
  year = {2024},
  volume = {170},
  pages = {106782},
  doi = {10.1016/j.cor.2024.106782}
}
Kostenlos starten →