Crossref
An Efficient Branch-and-Bound Algorithm for Exact Clustering via Relational Decisions
International Journal of Engineering · 2027 · 40 (2) · 454-467
DOI: 10.5829/ije.2027.40.02b.10 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Engineering, 2027. Verfasst von P. Heidari und 2 weiteren Autor:innen.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Heidari, P., Arkat, J., & Ahmadizar, F. (2027). An Efficient Branch-and-Bound Algorithm for Exact Clustering via Relational Decisions. International Journal of Engineering, 40(2), 454-467. https://doi.org/10.5829/ije.2027.40.02b.10
Vancouver
Heidari P, Arkat J, Ahmadizar F. An Efficient Branch-and-Bound Algorithm for Exact Clustering via Relational Decisions. International Journal of Engineering. 2027;40(2):454-467. doi:10.5829/ije.2027.40.02b.10
BibTeX
@article{Heidari2027,
author = {Heidari, P. and Arkat, J. and Ahmadizar, F.},
title = {An Efficient Branch-and-Bound Algorithm for Exact Clustering via Relational Decisions},
journal = {International Journal of Engineering},
year = {2027},
volume = {40},
number = {2},
pages = {454--467},
doi = {10.5829/ije.2027.40.02b.10}
}
EUVIMED