Nonlinear integer programming for various forms of constraints
From MaRDI portal
Recommendations
- A branch and bound algorithm for solving a class of nonlinear integer programming problems
- Nonlinear integer programming algorithms: A survey
- A branch and bound algorithm for solving separable convex integer programming problems
- Nonlinear integer programming
- A discrete dynamic convexized method for nonlinear integer programming
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3174053 (Why is no real title available?)
- scientific article; zbMATH DE number 3783772 (Why is no real title available?)
- scientific article; zbMATH DE number 3230614 (Why is no real title available?)
- Quadratic knapsack problems
Cited in
(13)- Nonlinear integer programming algorithms: A survey
- Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming
- Nonlinear integer goal programming
- A continuous approach to nonlinear integer programming
- Finding discrete global minima with a filled function for integer programming
- Discrete filled function method for discrete global optimization
- Generalized nonlinear Lagrangian formulation for bounded integer programming
- Distance confined path problem and separable integer programming
- Nonlinear integer programming
- Models and methods of solution of quadratic integer programming problems
- Solving nonlinear programming problems with very many constraints
- Identifying a global optimizer with filled function for nonlinear integer programming
- A dynamic programming algorithm for multiple-choice constraints
This page was built for publication: Nonlinear integer programming for various forms of constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3325471)