On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming.
Alberto Del PiaPublished in: IPCO (2016)
Keyphrases
- quadratic programming
- approximation algorithms
- mixed integer
- linear programming
- linear program
- np hard
- feasible solution
- objective function
- optimal solution
- network design problem
- convex hull
- mixed integer programming
- special case
- primal dual
- quadratic program
- minimum cost
- lot sizing
- worst case
- cutting plane
- valid inequalities
- exact algorithms
- lower bound
- integer programming
- support vector machine
- optimization problems
- column generation
- continuous variables
- scheduling problem
- machine learning
- knapsack problem
- computational complexity