Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems.
Timothy LeeJohn E. MitchellPublished in: Discret. Optim. (2017)
Keyphrases
- approximation algorithms
- combinatorial optimization problems
- semidefinite programming
- primal dual
- np hard
- knapsack problem
- linear programming
- semidefinite
- exact algorithms
- optimal solution
- metaheuristic
- optimization problems
- combinatorial optimization
- feasible solution
- interior point methods
- special case
- lower bound
- ant colony optimization
- min cost
- worst case
- traveling salesman problem
- vehicle routing problem
- quadratically constrained quadratic
- job shop scheduling
- linear program
- linear programming relaxation
- precedence constraints
- maximum margin
- integer programming
- convex optimization
- benchmark problems
- job shop scheduling problem
- search methods
- column generation
- neural network
- convergence rate
- quadratic programming
- tabu search
- scheduling problem
- lp relaxation
- branch and bound algorithm
- simulated annealing
- evolutionary algorithm
- search space
- objective function
- machine learning