Mixed Integer Convex Quadratic Programming is Fixed Parameter Tractable.
Alberto Del PiaPublished in: CoRR (2023)
Keyphrases
- mixed integer
- convex quadratic programming
- fixed parameter tractable
- np hard
- computational problems
- np complete
- linear program
- optimal solution
- global constraints
- feasible solution
- lot sizing
- bounded treewidth
- convex hull
- variational inequalities
- conjunctive queries
- continuous variables
- primal dual
- abstract argumentation
- scheduling problem
- lower bound
- approximation algorithms
- integer programming
- mathematical model
- constraint satisfaction problems
- linear programming
- computational complexity
- game theory
- knapsack problem
- multistage
- training set