GRIP: scalable 3D global routing using integer programming.
Tai-Hsuan WuAzadeh DavoodiJeffrey T. LinderothPublished in: DAC (2009)
Keyphrases
- integer programming
- np hard
- linear programming
- cutting plane
- cutting plane algorithm
- lagrangian relaxation
- set covering problem
- constraint programming
- production planning
- ai planning
- set covering
- integer program
- transportation problem
- valid inequalities
- network flow
- facility location
- dantzig wolfe decomposition
- column generation
- inference problems
- set partitioning
- integer programming formulations
- shortest path
- upper bound
- search algorithm
- vehicle routing problem with time windows
- routing problem
- np complete
- objective function