Convex quadratic sets and the complexity of mixed integer convex quadratic programming
From MaRDI portal
Cites work
- A polynomial algorithm for minimizing discrete convic functions in fixed dimension
- A second-order cone based approach for solving the trust-region subproblem and its variants
- An approximation algorithm for indefinite mixed integer quadratic programming
- Complexity, exactness, and rationality in polynomial optimization
- Generalized Inverses and Ranks of Block Matrices
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 3945887 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- Integer conic function minimization based on the comparison oracle
- Integer convex minimization by mixed integer linear optimization
- Integer Programming
- Integer Programming with a Fixed Number of Variables
- Maximal quadratic-free sets
- Mixed-integer quadratic programming is in NP
- On approximation algorithms for concave mixed-integer quadratic programming
- On approximation algorithms for concave mixed-integer quadratic programming
- On the complexity of quasiconvex integer minimization problem
- On the General Solution to Systems of Mixed-Integer Linear Equations
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Quadratic programming is in NP
- Second-order cone programming
- Some NP-complete problems in quadratic and nonlinear programming
- Subdeterminants and concave integer quadratic programming
- Systems of distinct representatives and linear algebra
- The polynomial solvability of convex quadratic programming
This page was built for publication: Convex quadratic sets and the complexity of mixed integer convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6937848)
