LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP.
Daniel PrusaTomás WernerPublished in: SODA (2017)
Keyphrases
- lp relaxation
- np hard problems
- knapsack problem
- np hard
- optimal solution
- linear programming
- constraint programming
- integer programming
- optimization problems
- dynamic programming
- linear program
- feasible solution
- greedy algorithm
- cutting plane
- global constraints
- energy minimization
- scheduling problem
- evolutionary algorithm
- integer program
- reinforcement learning
- column generation
- message passing
- solution quality