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

researchr

You are not signed in
Sign in
Sign up

Yanzhen Zhang, Peiping Shen, Bingdi Huang, Yaping Deng. An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs. J. Computational Applied Mathematics, 450:116035, 2024. [doi]

Abstract is missing.

runs on WebDSL