Nonlinear integer programming algorithms: A survey
This paper surveys the progress that has been made with the task of solving pure as well as mixed nonlinear integer programming problems. Included are descriptions of several general algorithms for solving such problems, as well as some special purpose algorithms. It has been indicated that most of these algorithms fall into the following categories: Linearization of polynomial programs, partial enumeration techniques, penalty function approaches, separable programming procedures, dynamic programming methods and the branch-and-bound procedures. Each of these solution procedures is briefly described.
scientific article; zbMATH DE number 3972637