Floorplan area minimization using Lagrangian relaxation.
Fung Yu YoungChris C. N. ChuW. S. LukY. C. WongPublished in: ISPD (2000)
Keyphrases
- lagrangian relaxation
- integer programming
- feasible solution
- lower bound
- dynamic programming
- objective function
- np hard
- linear programming
- column generation
- branch and bound algorithm
- lower and upper bounds
- relaxation algorithm
- capacity constraints
- dual decomposition
- mixed integer programming
- lagrangian heuristic
- mixed integer program
- mixed integer linear programs
- shortest path
- network design problem
- subgradient method
- branch and bound
- valid inequalities
- single machine scheduling problem
- data structure
- optimal solution
- upper bound
- data points
- cutting plane algorithm
- search algorithm