A note on the primal-dual column generation method for combinatorial optimization.
Pedro Augusto MunariPablo González-BrevisJacek GondzioPublished in: Electron. Notes Discret. Math. (2011)
Keyphrases
- combinatorial optimization
- primal dual
- generation method
- linear programming
- affine scaling
- convex optimization
- linear program
- traveling salesman problem
- semidefinite programming
- linear programming problems
- interior point methods
- metaheuristic
- combinatorial optimization problems
- simulated annealing
- optimization problems
- approximation algorithms
- convergence rate
- branch and bound
- variational inequalities
- interior point algorithm
- simplex algorithm
- interior point
- algorithm for linear programming
- combinatorial problems
- branch and bound algorithm
- simplex method
- quadratic assignment problem
- genetic algorithm
- max flow min cut
- reinforcement learning
- objective function
- valid inequalities
- optimal solution
- special case
- denoising
- neural network