Quantum annealing with inequality constraints: the set cover problem.
Hristo N. DjidjevPublished in: CoRR (2023)
Keyphrases
- set cover
- inequality constraints
- greedy algorithm
- convex quadratic
- interior point methods
- approximation algorithms
- simulated annealing
- constrained optimization
- primal dual
- np hard
- solution space
- nonlinear programming
- network flow
- greedy heuristic
- equality constraints
- linear programming
- convex hull
- linear program
- optimality conditions
- support vector
- special case
- exact algorithms
- semidefinite programming
- variational inequalities
- least squares support vector machine
- objective function
- worst case
- minimum cost
- constrained optimization problems
- computationally intensive
- knapsack problem
- constraint satisfaction problems
- optimal solution