A note on a deterministic global optimization algorithm
From MaRDI portal
Publication:941475
DOI10.1016/j.amc.2008.01.021zbMath1154.65048OpenAlexW1994468402MaRDI QIDQ941475
Hong-Wei Jiao, Yong-Qiang Chen
Publication date: 1 September 2008
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2008.01.021
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32)
Related Items (6)
A practicable branch and bound algorithm for sum of linear ratios problem ⋮ Outcome space range reduction method for global optimization of sum of affine ratios problem ⋮ Global optimization algorithm for sum of generalized polynomial ratios problem ⋮ A linearized relaxing algorithm for the specific nonlinear optimization problem ⋮ Study of multiscale global optimization based on parameter space partition ⋮ Global optimization for sum of linear ratios problem using new pruning technique
Cites Work
This page was built for publication: A note on a deterministic global optimization algorithm
