A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming.
Daniel DadushPublished in: LATIN (2012)
Keyphrases
- integer programming
- np hard
- linear programming
- set covering
- transportation problem
- integer program
- optimal solution
- column generation
- learning algorithm
- knapsack problem
- special case
- computational complexity
- simulated annealing
- optimization algorithm
- combinatorial optimization
- constraint programming
- support vector machine
- dynamic programming
- network flow
- lagrangian relaxation