Nonlinear integer programming algorithms: A survey
type: Item
instance of: scholarly article
title: Nonlinear integer programming algorithms: A survey
zbMATH Open document ID: 0602.90102
author: B. George
published in: Opsearch
publication date: 1983-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90-02
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3972637
zbMATH Keywords: survey
zbMATH Keywords: Linearization
zbMATH Keywords: partial enumeration
zbMATH Keywords: penalty function
zbMATH Keywords: separable programming
zbMATH Keywords: branch-and-bound
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 3972637