The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation.
Frederico Paiva QuintãoAlexandre Salles da CunhaGeraldo Robson MateusAbilio LucenaPublished in: Discret. Appl. Math. (2010)
Keyphrases
- lagrangian relaxation
- integer programming
- lower bound
- column generation
- np hard
- linear programming
- feasible solution
- branch and bound algorithm
- dynamic programming
- lower and upper bounds
- capacity constraints
- dual decomposition
- lagrangian heuristic
- relaxation algorithm
- optimal solution
- mixed integer programming
- mixed integer program
- shortest path
- mixed integer linear programs
- lagrangian dual
- cutting plane algorithm
- upper bound
- network design problem
- single machine scheduling problem
- dual variables
- scheduling problem
- valid inequalities
- search algorithm
- mixed integer
- linear program
- neural network