A Deterministic Approximation Algorithm for a Minmax Integer Programming Problem.
Chi-Jen LuPublished in: SODA (1999)
Keyphrases
- integer programming
- np hard
- transportation problem
- optimal solution
- dynamic programming
- worst case
- linear programming
- lagrangian relaxation
- relaxation algorithm
- randomized algorithm
- combinatorial optimization
- search space
- computational complexity
- learning algorithm
- objective function
- lp relaxation
- dantzig wolfe decomposition
- cutting plane algorithm
- approximation guarantees
- set covering
- vehicle routing problem with time windows
- network flow
- feasible solution
- branch and bound
- constraint programming
- optimization algorithm
- search algorithm