Monotonic Optimization: Branch and Cut Methods
From MaRDI portal
Publication:5421799
DOI10.1007/0-387-25570-2_2zbMath1136.90446OpenAlexW121557243MaRDI QIDQ5421799
Hoang Tuy, Phan Thien Thach, Faiz A. Al-Khayyal
Publication date: 24 October 2007
Published in: Essays and Surveys in Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/0-387-25570-2_2
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)
Related Items (12)
A robust algorithm for quadratic optimization under quadratic constraints ⋮ Algorithms for projecting a point onto a level surface of a continuous function on a compact set ⋮ Global minimization for generalized polynomial fractional program ⋮ A robust algorithm for generalized geometric programming ⋮ On a decomposition method for nonconvex global optimization ⋮ A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints ⋮ A novel approach to bilevel nonlinear programming ⋮ Nonconcave utility maximisation in the MIMO broadcast channel ⋮ \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization ⋮ A nonisolated optimal solution for special reverse convex programming problems ⋮ A nonisolated optimal solution of general linear multiplicative programming problems ⋮ Solving sum of quadratic ratios fractional programs via monotonic function
Uses Software
This page was built for publication: Monotonic Optimization: Branch and Cut Methods
