Nonlinear integer programming algorithms: A survey

MaRDI QIDQ1082264zbMATH OpenFDO

Authors B. George

Publication date 1983

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundLinearizationpartial enumerationpenalty functionseparable programmingsurvey

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30)

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.

Recommendations

• A branch and bound algorithm for solving a class of nonlinear integer programming problems
• scientific article; zbMATH DE number 1101647
• Nonlinear integer programming
• State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
• Nonlinear integer programming for various forms of constraints

Cited in

(19)

• Algorithms for nonlinear integer bicriterion problems
• An enumerative algorithm framework for a class of nonlinear integer programming problems
• An improved branch and bound algorithm for mixed integer nonlinear programs
• A branch and bound algorithm for solving separable convex integer programming problems
• A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
• A continuous approach to nonlinear integer programming
• Executing join queries in an uncertain distributed environment
• Allocating relations in a distributed database system
• Nonlinear integer programming
• Nonlinear integer programming for various forms of constraints
• Nonlinear integer programming
• A branch and bound algorithm for solving a class of nonlinear integer programming problems
• scientific article; zbMATH DE number 4029261 (Why is no real title available?)
• scientific article; zbMATH DE number 4037605 (Why is no real title available?)
• scientific article; zbMATH DE number 1383149 (Why is no real title available?)
• An approximate algorithm for nonlinear integer programming
• An approximate algorithm for nonlinear integer programming
• A partial enumeration algorithm for pure nonlinear integer programming
• Improved Lagrangean decomposition: An application to the generalized assignment problem

This page was built for publication: Nonlinear integer programming algorithms: A survey

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