On approximation algorithms for concave mixed-integer quadratic programming
From MaRDI portal
Publication:1800986
DOI10.1007/s10107-017-1178-8zbMath1406.90080OpenAlexW2739268873MaRDI QIDQ1800986
Publication date: 26 October 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-017-1178-8
Integer programming (90C10) Mixed integer programming (90C11) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Proximity in concave integer quadratic programming ⋮ Complexity of optimizing over the integers ⋮ An approximation algorithm for indefinite mixed integer quadratic programming ⋮ Subdeterminants and Concave Integer Quadratic Programming
Cites Work
- Mixed-integer quadratic programming is in NP
- Approximation algorithms for indefinite quadratic programming
- Chvátal closures for mixed integer programming problems
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
- Constrained global optimization: algorithms and applications
- Quadratic programming with one negative eigenvalue is NP-hard
- On integer points in polyhedra
- Some simplified NP-complete graph problems
- Pivoting techniques for symmetric Gaussian elimination
- Note on the complexity of the mixed-integer hull of a polyhedron
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- Quadratic programming is in NP
- Integer Programming with a Fixed Number of Variables
- On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming
- Integer Programming
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Some NP-complete problems in quadratic and nonlinear programming
- On the existence of optimal solutions to integer and mixed-integer programming problems
- An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Computationally Related Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On approximation algorithms for concave mixed-integer quadratic programming
