Proximity in concave integer quadratic programming
From MaRDI portal
Publication:2149572
DOI10.1007/s10107-021-01655-wzbMath1494.90054arXiv2006.01718OpenAlexW3165501148MaRDI QIDQ2149572
Publication date: 29 June 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.01718
sensitivityconcave minimizationquadratic programmingproximityinteger quadratic programmingsubdeterminants
Integer programming (90C10) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed-integer quadratic programming is in NP
- Some proximity and sensitivity results in quadratic integer programming
- The relationship between integer and real solutions of constrained convex programming
- On approximation algorithms for concave mixed-integer quadratic programming
- The complexity of approximating a nonlinear program
- Distances to lattice points in knapsack polyhedra
- Distances between optimal solutions of mixed-integer programs
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming
- Integer Programming
- Sensitivity theorems in integer linear programming
- Subdeterminants and Concave Integer Quadratic Programming
- On Proximity for k-Regular Mixed-Integer Linear Optimization
- Integer quadratic programming in the plane
- Convex separable optimization is not much harder than linear optimization
This page was built for publication: Proximity in concave integer quadratic programming