A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming
Daniel DadushPublished in: CoRR (2011)
Keyphrases
- integer programming
- np hard
- learning algorithm
- linear programming
- set covering problem
- set covering
- transportation problem
- optimal solution
- computational complexity
- dynamic programming
- integer program
- network design problem
- qos multicast routing
- vehicle routing problem with time windows
- exact solution
- column generation
- benchmark problems