A global router with a theoretical bound on the optimal solution.
Robert C. Carden IVJianmin LiChung-Kuan ChengPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (1996)
Keyphrases
- optimal solution
- lower bound
- integer solution
- upper bound
- number of iterations required
- artificial intelligence
- objective function
- end to end
- global information
- knapsack problem
- theoretical analysis
- worst case
- linear program
- linear programming
- branch and bound
- data structure
- databases
- data mining
- iterative procedure
- theoretical basis
- column generation
- global optimum
- total cost
- sensor networks
- branch and bound algorithm
- feasible solution
- error bounds
- data sets