EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

An Efficient Iterated Greedy Algorithm for the Maximum Bisection Problem

Xiaoxia Tao, Lijuan Wang

Electronics Letters · 2026-01 · 62 (1)

DOI: 10.1049/ell2.70674 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Electronics Letters, online erschienen am 20.08.2026. Verfasst von Xiaoxia Tao und 1 weiteren Autor:innen. Die Arbeit nennt 22 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper, we propose an iterated greedy algorithm, called IGLS (iterated greedy algorithm combined with local search), which enables the algorithm to explore a broader solution space, effectively escaping local optima and providing a more robust search mechanism. Additionally, local search strategies are integrated into our algorithm. This hybridisation of greedy and local search ensures that the algorithm benefits from the balanced search ability. We perform extensive experiments to evaluate the algorithm on diverse benchmark instances. The empirical evaluation demonstrates that the IGLS algorithm can produce high‐quality solutions and outperform the state‐of‐the‐art methods for handling large graphs.

Zitieren

APA

Tao, X., & Wang, L. (2026). An Efficient Iterated Greedy Algorithm for the Maximum Bisection Problem. Electronics Letters, 62(1). https://doi.org/10.1049/ell2.70674

Vancouver

Tao X, Wang L. An Efficient Iterated Greedy Algorithm for the Maximum Bisection Problem. Electronics Letters. 2026;62(1). doi:10.1049/ell2.70674

BibTeX
@article{Tao2026,
  author = {Tao, Xiaoxia and Wang, Lijuan},
  title = {An Efficient Iterated Greedy Algorithm for the Maximum Bisection Problem},
  journal = {Electronics Letters},
  year = {2026},
  volume = {62},
  number = {1},
  doi = {10.1049/ell2.70674}
}
Kostenlos starten →