EUVIMEDEUVIMED entdecken
Crossref

An Enhanced SOCP Relaxation-Based Branch and Bound Algorithm for Quadratic Programming with a Second-Order Cone Constraint and Linear Inequalities

Jing Zhou, Ye Tian, Lei Zhang

Journal of the Operations Research Society of China · 06.05.2026

DOI: 10.1007/s40305-026-00693-5 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of the Operations Research Society of China, online erschienen am 06.05.2026. Verfasst von Jing Zhou und 2 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Zhejiang Province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Natural Science Foundation of China
  • Natural Science Foundation of Zhejiang Province

Zitieren

APA

Zhou, J., Tian, Y., & Zhang, L. (2026). An Enhanced SOCP Relaxation-Based Branch and Bound Algorithm for Quadratic Programming with a Second-Order Cone Constraint and Linear Inequalities. Journal of the Operations Research Society of China. https://doi.org/10.1007/s40305-026-00693-5

Vancouver

Zhou J, Tian Y, Zhang L. An Enhanced SOCP Relaxation-Based Branch and Bound Algorithm for Quadratic Programming with a Second-Order Cone Constraint and Linear Inequalities. Journal of the Operations Research Society of China. 2026. doi:10.1007/s40305-026-00693-5

BibTeX
@article{Zhou2026,
  author = {Zhou, Jing and Tian, Ye and Zhang, Lei},
  title = {An Enhanced SOCP Relaxation-Based Branch and Bound Algorithm for Quadratic Programming with a Second-Order Cone Constraint and Linear Inequalities},
  journal = {Journal of the Operations Research Society of China},
  year = {2026},
  doi = {10.1007/s40305-026-00693-5}
}
Kostenlos starten →