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