An optimal local approximation algorithm for max-min linear programs
Patrik FloréenJoel KaasinenPetteri KaskiJukka SuomelaPublished in: CoRR (2008)
Keyphrases
- max min
- linear program
- dynamic programming
- optimal solution
- linear programming
- worst case
- objective function
- simplex method
- learning algorithm
- extreme points
- min max
- genetic algorithm
- mixed integer linear program
- knapsack problem
- search strategy
- convex hull
- np hard
- primal dual
- search space
- simulated annealing
- supply chain
- exhaustive search
- interior point methods
- feature space
- computational complexity
- neural network
- strongly polynomial