On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming
From MaRDI portal
Publication:3186487
DOI10.1007/978-3-319-33461-5_1zbMath1419.90074WikidataQ57568070 ScholiaQ57568070MaRDI QIDQ3186487
Publication date: 10 August 2016
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-33461-5_1
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed-integer quadratic programming is in NP
- Chvátal closures for mixed integer programming problems
- Constrained global optimization: algorithms and applications
- Quadratic programming with one negative eigenvalue is NP-hard
- On integer points in polyhedra
- Note on the complexity of the mixed-integer hull of a polyhedron
- A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
- Complexity of integer quasiconvex polynomial optimization
- 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
- 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
- Computationally Related Problems
