Optimization methods for a class of integer polynomial programming problems
From MaRDI portal
Recommendations
- Global optimality conditions for a class of polynomial integer programming problems with linear constraints
- Global optimality conditions for some classes of polynomial integer programming problems
- Global optimality conditions and optimization methods for polynomial programming problems
- Global optimality conditions and optimization methods for quadratic integer programming problems
- Global optimality conditions and optimization methods for constrained polynomial programming problems
Cited in
(10)- scientific article; zbMATH DE number 4033489 (Why is no real title available?)
- Global optimality conditions for some classes of polynomial integer programming problems
- Large final polynomials from integer programming
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- Global optimality conditions for a class of polynomial integer programming problems with linear constraints
- scientific article; zbMATH DE number 5874901 (Why is no real title available?)
- scientific article; zbMATH DE number 5925034 (Why is no real title available?)
- scientific article; zbMATH DE number 1505873 (Why is no real title available?)
- Global optimality conditions and optimization methods for quadratic integer programming problems
- Global optimality conditions and optimization methods for polynomial programming problems
This page was built for publication: Optimization methods for a class of integer polynomial programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917964)