scientific article; zbMATH DE number 970339

MaRDI QIDQ5688488zbMATH OpenFDO

Authors Nguyen Van Thoai, Reiner Horst

Publication date 11 March 1997

zbMATH Keywords

branch and boundunimodularityglobal minimizationseparable concave functioninteger global optimizationadditional box constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30) Integer programming (90C10)

Recommendations

• A finite algorithm for global minimization of separable concave programs
• scientific article; zbMATH DE number 970356
• A finite algorithm for globally minimizing a concave function under linear constraints and its applications
• Finite algorithms for global minimization of separable concave programs
• A finite algorithm for concave minimization over a polyhedron

Cited in

(2)

• The search for a global minimum in problems of nonconvex programming with dependences that are biseparable superpositions of convex functions
• Subdeterminants and concave integer quadratic programming

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5688488)