A frequent pattern mining-based hybrid evolutionary algorithm for the k-clustering minimum biclique completion problem
Computers & Operations Research · 2026-12 · 196 · 107642
DOI: 10.1016/j.cor.2026.107642 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2026-12. Verfasst von Dawei Wu und 2 weiteren Autor:innen. Die Arbeit nennt 38 Literaturangaben. Gefördert von: Fundamental Research Funds for the Central Universities, Humanities and Social Science Fund of Ministry of Education, China Postdoctoral Science Foundation.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Fundamental Research Funds for the Central Universities
- Humanities and Social Science Fund of Ministry of Education
- China Postdoctoral Science Foundation
- Liaoning Provincial Natural Science Foundation
- National Natural Science Foundation of China
Zitieren
APA
Wu, D., Zhang, Z., & Zhou, Q. (2026). A frequent pattern mining-based hybrid evolutionary algorithm for the k-clustering minimum biclique completion problem. Computers & Operations Research, 196, 107642. https://doi.org/10.1016/j.cor.2026.107642
Vancouver
Wu D, Zhang Z, Zhou Q. A frequent pattern mining-based hybrid evolutionary algorithm for the k-clustering minimum biclique completion problem. Computers & Operations Research. 2026;196:107642. doi:10.1016/j.cor.2026.107642
BibTeX
@article{Wu2026,
author = {Wu, Dawei and Zhang, Zhiying and Zhou, Qing},
title = {A frequent pattern mining-based hybrid evolutionary algorithm for the k-clustering minimum biclique completion problem},
journal = {Computers & Operations Research},
year = {2026},
volume = {196},
pages = {107642},
doi = {10.1016/j.cor.2026.107642}
}
EUVIMED