EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Tight convex relaxation-based simplex branch-and-bound algorithm for generalized linear multiplicative programming

Bo Zhang, Suxia Ma, Yuelin Gao

Operations Research Perspectives · 2026-12 · 17 · 100424

DOI: 10.1016/j.orp.2026.100424 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Operations Research Perspectives, 2026-12. Verfasst von Bo Zhang und 2 weiteren Autor:innen. Die Arbeit nennt 32 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Zhang, B., Ma, S., & Gao, Y. (2026). Tight convex relaxation-based simplex branch-and-bound algorithm for generalized linear multiplicative programming. Operations Research Perspectives, 17, 100424. https://doi.org/10.1016/j.orp.2026.100424

Vancouver

Zhang B, Ma S, Gao Y. Tight convex relaxation-based simplex branch-and-bound algorithm for generalized linear multiplicative programming. Operations Research Perspectives. 2026;17:100424. doi:10.1016/j.orp.2026.100424

BibTeX
@article{Zhang2026,
  author = {Zhang, Bo and Ma, Suxia and Gao, Yuelin},
  title = {Tight convex relaxation-based simplex branch-and-bound algorithm for generalized linear multiplicative programming},
  journal = {Operations Research Perspectives},
  year = {2026},
  volume = {17},
  pages = {100424},
  doi = {10.1016/j.orp.2026.100424}
}
Kostenlos starten →