Buffered Interconnect Tree Optimization Using Lagrangian Relaxation and Dynamic Programming.
Shih-Yih LaiRoss BaldickPublished in: ICCD (2001)
Keyphrases
- lagrangian relaxation
- dynamic programming
- dual decomposition
- subgradient method
- integer programming
- branch and bound algorithm
- lower bound
- feasible solution
- column generation
- np hard
- linear programming
- capacity constraints
- dual variables
- lower and upper bounds
- optimization problems
- single machine scheduling problem
- relaxation algorithm
- cutting plane algorithm
- genetic algorithm
- constrained optimization
- shortest path
- combinatorial optimization
- valid inequalities
- upper bound
- state space
- optimal solution
- neural network
- lagrangian heuristic
- branch and bound
- multistage
- mixed integer program
- search space
- search algorithm
- lagrangian dual