EUVIMEDEUVIMED entdecken
Crossref

Improved approximation for min-max k-path cover with neighborhoods: Leveraging refined geometric spanning and adaptive recombination

Jun Wu, Feng Chu, Zhen Yang, Yongxi Cheng

European Journal of Operational Research · 2027-02 · 337 (1) · 23-39

DOI: 10.1016/j.ejor.2026.06.014 ↗

Kurz gefasst

Fachartikel in der Zeitschrift European Journal of Operational Research, 2027-02. Verfasst von Jun Wu und 3 weiteren Autor:innen. Die Arbeit nennt 43 Literaturangaben. Gefördert von: China Scholarship Council.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • China Scholarship Council

Zitieren

APA

Wu, J., Chu, F., Yang, Z., & Cheng, Y. (2027). Improved approximation for min-max k-path cover with neighborhoods: Leveraging refined geometric spanning and adaptive recombination. European Journal of Operational Research, 337(1), 23-39. https://doi.org/10.1016/j.ejor.2026.06.014

Vancouver

Wu J, Chu F, Yang Z, Cheng Y. Improved approximation for min-max k-path cover with neighborhoods: Leveraging refined geometric spanning and adaptive recombination. European Journal of Operational Research. 2027;337(1):23-39. doi:10.1016/j.ejor.2026.06.014

BibTeX
@article{Wu2027,
  author = {Wu, Jun and Chu, Feng and Yang, Zhen and Cheng, Yongxi},
  title = {Improved approximation for min-max k-path cover with neighborhoods: Leveraging refined geometric spanning and adaptive recombination},
  journal = {European Journal of Operational Research},
  year = {2027},
  volume = {337},
  number = {1},
  pages = {23--39},
  doi = {10.1016/j.ejor.2026.06.014}
}
Kostenlos starten →