Advanced probabilistic tabu search for the fair max-min diversity problem
Computers & Operations Research · 2026-12 · 196 · 107650
DOI: 10.1016/j.cor.2026.107650 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2026-12. Verfasst von He Zheng und 3 weiteren Autor:innen. Die Arbeit nennt 60 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: Ministerio de Ciencia e Innovación.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Ministerio de Ciencia e Innovación
Zitieren
APA
Zheng, H., Martínez-Gavara, A., Martí, R., & Glover, F. (2026). Advanced probabilistic tabu search for the fair max-min diversity problem. Computers & Operations Research, 196, 107650. https://doi.org/10.1016/j.cor.2026.107650
Vancouver
Zheng H, Martínez-Gavara A, Martí R, Glover F. Advanced probabilistic tabu search for the fair max-min diversity problem. Computers & Operations Research. 2026;196:107650. doi:10.1016/j.cor.2026.107650
BibTeX
@article{Zheng2026,
author = {Zheng, He and Martínez-Gavara, Anna and Martí, Rafael and Glover, Fred},
title = {Advanced probabilistic tabu search for the fair max-min diversity problem},
journal = {Computers & Operations Research},
year = {2026},
volume = {196},
pages = {107650},
doi = {10.1016/j.cor.2026.107650}
}
EUVIMED