Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem.
Victor F. CavalcanteCid C. de SouzaPublished in: ESCAPE (2007)
Keyphrases
- lagrangian relaxation
- cutting plane
- integer programming
- column generation
- lower bound
- cutting plane algorithm
- mixed integer program
- np hard
- integer program
- valid inequalities
- linear programming
- mixed integer programming
- constraint programming
- linear program
- branch and bound
- branch and bound algorithm
- upper bound
- vehicle routing problem with time windows
- optimal solution
- network flow
- feasible solution
- lower and upper bounds
- knapsack problem
- dynamic programming
- support vector
- objective function