Optimality criterion for a class of nonlinear integer programs.
From MaRDI portal
Recommendations
- The quadratic Graver cone, quadratic integer minimization, and extensions
- Nonlinear discrete optimization. An algorithmic theory
- Global optimality conditions for some classes of polynomial integer programming problems
- On the greedy solution in integer linear programming
- Partial Gröbner bases for multiobjective integer linear optimization
Cites work
- scientific article; zbMATH DE number 1302176 (Why is no real title available?)
- scientific article; zbMATH DE number 3001142 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A primal all-integer algorithm based on irreducible solutions
- On the foundations of linear and integer linear programming I
- Optimality criterion for a class of nonlinear integer programs.
- Test sets of integer programs
Cited in
(10)- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- Lower bounds on the graver complexity of M-fold matrices
- A polynomial oracle-time algorithm for convex integer minimization
- Optimality criterion for a class of nonlinear integer programs.
- Comment on A nonlinear Lagrangian dual for integer programming.
- Cone superadditivity of discrete convex functions
- On test sets for nonlinear integer maximization
- Vector and matrix apportionment problems and separable convex integer optimization
- \(n\)-fold integer programming in cubic time
- La valeur optimale des programmes entiers. (The optimal value of integer programs)
This page was built for publication: Optimality criterion for a class of nonlinear integer programs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703262)
