An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs

Yanzhen Zhang, Peiping Shen, Bingdi Huang, Yaping Deng

Source record

Source: Crossref

Published: Nov 1, 2024

DOI: 10.1016/j.cam.2024.116035

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.