EUVIMEDEUVIMED entdecken
Crossref

A outcome-space-based branch-and-bound algorithm for a class of sum of convex-concave quadratic ratio programs

Peng Hu, Zhiyou Wu, Hengyang Gu, Shaojun Yin, Xinyi Su

Numerical Algorithms · 11.03.2026

DOI: 10.1007/s11075-026-02350-7 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Numerical Algorithms, online erschienen am 11.03.2026. Verfasst von Peng Hu und 4 weiteren Autor:innen. Die Arbeit nennt 41 Literaturangaben. Gefördert von: the National Key R&D Program of China, the National Natural Science Foundation of China, Xichang University Doctoral Research Initiation Project.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • the National Key R&D Program of China
  • the National Natural Science Foundation of China
  • Xichang University Doctoral Research Initiation Project

Zitieren

APA

Hu, P., Wu, Z., Gu, H., Yin, S., & Su, X. (2026). A outcome-space-based branch-and-bound algorithm for a class of sum of convex-concave quadratic ratio programs. Numerical Algorithms. https://doi.org/10.1007/s11075-026-02350-7

Vancouver

Hu P, Wu Z, Gu H, Yin S, Su X. A outcome-space-based branch-and-bound algorithm for a class of sum of convex-concave quadratic ratio programs. Numerical Algorithms. 2026. doi:10.1007/s11075-026-02350-7

BibTeX
@article{Hu2026,
  author = {Hu, Peng and Wu, Zhiyou and Gu, Hengyang and Yin, Shaojun and Su, Xinyi},
  title = {A outcome-space-based branch-and-bound algorithm for a class of sum of convex-concave quadratic ratio programs},
  journal = {Numerical Algorithms},
  year = {2026},
  doi = {10.1007/s11075-026-02350-7}
}
Kostenlos starten →