EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

A reinforcement learning-guided breakout local search algorithm for the heaviest subgraph problem

He Zheng, Jin-Kao Hao, Rafael Martí, Yang Wang

Computers & Operations Research · 2026-12 · 196 · 107674

DOI: 10.1016/j.cor.2026.107674 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computers & Operations Research, 2026-12. Verfasst von He Zheng und 3 weiteren Autor:innen. Die Arbeit nennt 45 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: European Regional Development Fund, Generalitat Valenciana, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • European Regional Development Fund
  • Generalitat Valenciana
  • National Natural Science Foundation of China

Zitieren

APA

Zheng, H., Hao, J., Martí, R., & Wang, Y. (2026). A reinforcement learning-guided breakout local search algorithm for the heaviest subgraph problem. Computers & Operations Research, 196, 107674. https://doi.org/10.1016/j.cor.2026.107674

Vancouver

Zheng H, Hao J, Martí R, Wang Y. A reinforcement learning-guided breakout local search algorithm for the heaviest subgraph problem. Computers & Operations Research. 2026;196:107674. doi:10.1016/j.cor.2026.107674

BibTeX
@article{Zheng2026,
  author = {Zheng, He and Hao, Jin-Kao and Martí, Rafael and Wang, Yang},
  title = {A reinforcement learning-guided breakout local search algorithm for the heaviest subgraph problem},
  journal = {Computers & Operations Research},
  year = {2026},
  volume = {196},
  pages = {107674},
  doi = {10.1016/j.cor.2026.107674}
}
Kostenlos starten →