Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems.
Fabián A. ChudakVânia EleutérioPublished in: IPCO (2005)
Keyphrases
- combinatorial optimization problems
- knapsack problem
- linear programming relaxation
- approximation schemes
- optimization problems
- combinatorial optimization
- discrete optimization
- metaheuristic
- approximation algorithms
- traveling salesman problem
- optimal solution
- ant colony optimization
- branch and bound
- continuous optimization problems
- np hard
- valid inequalities
- cutting plane
- production planning
- dynamic programming
- greedy algorithm
- evolutionary algorithm
- branch and bound algorithm
- column generation
- image processing
- special case
- lower bound
- objective function
- neural network