EUVIMEDEUVIMED entdecken
Crossref

A fast global algorithm for multi-linearly constrained separable binary quadratic program

Guangtai Qu, Shaoze Li, Zhibin Deng, Cheng Lu

Journal of Industrial and Management Optimization · 2025 · 21 (2) · 1456-1473

DOI: 10.3934/jimo.2024132 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Industrial and Management Optimization, 2025. Verfasst von Guangtai Qu und 3 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Qu, G., Li, S., Deng, Z., & Lu, C. (2025). A fast global algorithm for multi-linearly constrained separable binary quadratic program. Journal of Industrial and Management Optimization, 21(2), 1456-1473. https://doi.org/10.3934/jimo.2024132

Vancouver

Qu G, Li S, Deng Z, Lu C. A fast global algorithm for multi-linearly constrained separable binary quadratic program. Journal of Industrial and Management Optimization. 2025;21(2):1456-1473. doi:10.3934/jimo.2024132

BibTeX
@article{Qu2025,
  author = {Qu, Guangtai and Li, Shaoze and Deng, Zhibin and Lu, Cheng},
  title = {A fast global algorithm for multi-linearly constrained separable binary quadratic program},
  journal = {Journal of Industrial and Management Optimization},
  year = {2025},
  volume = {21},
  number = {2},
  pages = {1456--1473},
  doi = {10.3934/jimo.2024132}
}
Kostenlos starten →