scientific article; zbMATH DE number 7506674

zbMath1483.90114MaRDI QIDQ5070404

Junqiao Ma, Hong-Wei Jiao, You-lin Shang

Publication date: 11 April 2022

Full work available at URL: http://yokohamapublishers.jp/online2/oppjo/vol18/p195.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityglobal optimizationminimax linear fractional programmingimage space branch-and-bound algorithmlinearizing technique

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Related Items (3)

Global algorithm for a class of multiplicative programs using piecewise linear approximation technique ⋮ An efficient algorithm and complexity result for solving the sum of general affine ratios problem ⋮ Effective algorithm and computational complexity for solving sum of linear ratios problem

This page was built for publication: