EUVIMEDEUVIMED entdecken
Crossref

A New branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation

Hezhi Luo, Youmin Xu, Huixian Wu, Guoqiang Wang

Computational Optimization and Applications · 2025-01 · 90 (1) · 257-301

DOI: 10.1007/s10589-024-00622-3 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computational Optimization and Applications, online erschienen am 17.11.2024. Verfasst von Hezhi Luo und 3 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 54 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Luo, H., Xu, Y., Wu, H., & Wang, G. (2025). A New branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation. Computational Optimization and Applications, 90(1), 257-301. https://doi.org/10.1007/s10589-024-00622-3

Vancouver

Luo H, Xu Y, Wu H, Wang G. A New branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation. Computational Optimization and Applications. 2025;90(1):257-301. doi:10.1007/s10589-024-00622-3

BibTeX
@article{Luo2025,
  author = {Luo, Hezhi and Xu, Youmin and Wu, Huixian and Wang, Guoqiang},
  title = {A New branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation},
  journal = {Computational Optimization and Applications},
  year = {2025},
  volume = {90},
  number = {1},
  pages = {257--301},
  doi = {10.1007/s10589-024-00622-3}
}
Kostenlos starten →