Integer quadratic programming in the plane
From MaRDI portal
Recommendations
- Minimizing cubic and homogeneous polynomials over integers in the plane
- The efficient minimization of quadratic polynomials depending on integer variables, with quadratic monomials \(b^2_{i,j}(x_i - x_j)^2\)
- A linear algorithm for integer programming in the plane
- Convex minization over \(\mathbb Z^2\)
- On simultaneous approximation in quadratic integer programming
Cited in
(14)- The quadratic Graver cone, quadratic integer minimization, and extensions
- Proximity in concave integer quadratic programming
- On simultaneous approximation in quadratic integer programming
- Minimizing cubic and homogeneous polynomials over integers in the plane
- Polynomial time certifying algorithms for the planar quantified integer programming problem
- scientific article; zbMATH DE number 6007926 (Why is no real title available?)
- Integer quadratic quasi-polyhedra
- The efficient minimization of quadratic polynomials depending on integer variables, with quadratic monomials \(b^2_{i,j}(x_i - x_j)^2\)
- Models and methods of solution of quadratic integer programming problems
- Short Presburger Arithmetic Is Hard
- Mixed-integer quadratic programming is in NP
- A Polyhedral Frobenius Theorem with Applications to Integer Optimization
- Complexity of optimizing over the integers
- An approximation algorithm for indefinite mixed integer quadratic programming
This page was built for publication: Integer quadratic programming in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384023)
