Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds.
Jochen KönemannR. RaviPublished in: SIAM J. Comput. (2005)
Keyphrases
- primal dual
- duality gap
- linear programming
- linear program
- convex optimization
- affine scaling
- linear programming problems
- convergence rate
- interior point methods
- simplex algorithm
- interior point algorithm
- approximation algorithms
- algorithm for linear programming
- semidefinite programming
- interior point
- variational inequalities
- optimal solution
- search algorithm
- genetic algorithm
- convex programming
- lower bound
- worst case
- search space
- upper bound
- simplex method
- tabu search
- dual formulation
- simulated annealing
- augmented lagrangian
- saddle point
- reinforcement learning
- learning algorithm
- lower and upper bounds
- valid inequalities
- metaheuristic
- optimization problems
- np hard
- special case
- evolutionary algorithm