Integer linear programming models for global routing

INFORMS Journal on Computing

Volumn 18, Issue 2, 2006, Pages 137-150

  Behjat, Laleh ^a   Vannelli, Anthony ^b   Rosehart, William ^a  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Global routing; Integer programming; Linear programming; Linear relaxation; VLSI layout

Indexed keywords

EID: 33745725727     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0127     Document Type: Article

References (37)

1. Aarts, E. H. L., P. J. M. V. Laarhoven. 1985. Statistical cooling: A general approach to combinatorial optimization problems. Phillips J. Res. 4 193-226.
2. Alpert, C. J., M. Hrkic, J. Hu, A. B. Kahng, J. Lillis, B. Liu, S. T. Quay, S. S. Sapatnekar, A. J. Sullivan, P. Villarrubia. 2001. Buffered Steiner trees for difficult instances. Proc. Internat. Sympos. Physical Design. ACM Press, Now York, 4-9.
3. Andersen, E. D., J. Gondzio, C. Meszaros, X. Xu. 1996. Implementation of Interior-Point Methods for Large Scale Linear Programming. Kluwcr Academics Publishers, Dordrecht, The Netherlands.
4. Areibi, S., M. Xie, A. Vannelli. 2001. An efficient Steiner tree algorithm for VLSI global routing. Proc. Canadian Conf. Electrical and Comput. Engrg. IEEE Press, Toronto, Ontario, Canada, 1067-1072.
5. Behjat, L., D. Kucar, A. Vannelli. 2002. A novel eigenvector technique for large scale combinatorial problems in VLSI layout. J. Cambin. Optim. 6 271-286.
6. Bertsekas, D. P. 1995. Nonlinear Programming. Athena Scientific, Belmont, MA.
7. Chiang, C., C. K. Wong, M. Sarrafzadeh. 1994. A weighted Steiner tree-based global router with simultaneous length and density minimization. IEEE Trans. Comput.-Aided Design Integrated Circuits Systems 13 1461-1469.
8. Cong, J., P. H. Madden. 1997. Performance driven routing with multiple sources. IEEE Trans. Comput.-Aided Design Integrated Circuits Systems 16 410-419.
9. Cong, J., A. B. Kahng, K. Leung. 1998. Efficient algorithms for minimum shortest path Steiner arborescence problem with application to VLSI physical design. IEEE Trans. Comput.-Aided Design Integrated Circuits Systems 17 24-39.
10. Dees, W. A., P. G. Karger. 1982. Automated rip-up and reroute techniques. Proc. 19th IEEE/ACM Design Automation Conf. IEEE Press, Piscataway, NJ, 432-439.
11. Etawil, H., S. Areibi, A. Vannelli. 1999. Attractor-repeller approach for global placement. IEEE/ACM Internat. Conf. Comput.-Aided Design. IEEE Press, Piscataway, NJ, 7-11.
12. Floundas, C. A. 1995. Nonlinear and Mixed-Integer Optimization. Oxford University Press, Oxford, UK.
13. Hadlock, E 1975. Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4 221-225.
14. Hanan, M. 1966. Steiner's problem with rectilinear distance. SIAM J. Appl. Math. 14 255-265.
15. Hu, J., S. S. Sapatnekar. 2002. A timing-constrained simultaneous global routing algorithm. IEEE Trans. Comput.-Aided Design Integrated Circuits Systems 21 1025-1036.
16. Hu, T. C., M. T. Shing. 1985. A decomposition algorithm for circuit routing. IEEE Press, New York, 144-152.
17. Karmarkar, N. 1984. A new polynomial-time algorithm for linear programming. Combinatorica 4 373-395.
18. Karp, R. M. 1972. deducibility Among Combinatorial Problems. Plenum Press, New York.
19. Kastner, R., E. Bozorgzadeh, M. Sarrafzadeh. 2001. An exact algorithm for coupling-free routing. Proc. Internat. Sympos. Physical Design. ACM Press, New York, 10-15.
20. Kozminski, K. 1991. Benchmarks for layout synthesis-evaluation and current status. Proc. 28th ACM/IEEE Design Automation Conf. IEEE Press, Piscataway, NJ, 265-270.
21. Kozminski, K. 2004. Benchmarks for layout synthesis-Evolution and current status. ACM Sigda, New York. http://www.sigda.org/Archives/ProceedingArchives/ Dac/Dac91/papers/1991/dac91/17_3/17_3.htm.
22. Lee, C. Y. 1961. An algorithm for path connection and its application. IRE Trans. Electronic Comput. 10 346-365.
23. Lengauer, T. 1990. Combinatorial Algorithms for Integrated Circuit Layout. Wiley, New York.
24. Lengauer, T., M. Lungering. 2000. Provably good global routing of integrated circuits. SIAM J. Optim. 11 1-30.
25. Lundy, M. 1986. Convergence of an annealing algorithm. Math. Programming 34 111-124.
26. Madden, P. 2004. Standard cell benchmark circuits. BLAC CAD Binghamton Laboratory for Algorithms, Circuits, and Computer-Aided Design. Binghamton University, Binghamton, NY. http://vlsicad.cs.binghamton.edu/benchmarks.html.
27. Mehrotra, S. 1992. On the implementation of a primal-dual interiorpoint method. SIAM J. Optim. 2 575-601.
28. Ng, A. P., P. Raghavan, C. D. Thompson. 1987. Experimental results for a linear program global router. Comput. Artificial Intelligence 6 130-143.
29. Raghavan, P. 1988. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. Sci. 37 130-143.
30. Raghavan, P., C. D. Thompson. 1991. Multi-terminal global rout ing: A deterministic approximation scheme. Algorithmica 6 73-82.
31. Sherwani, N. 1999. Algorithms for VLSI Physical Design Automation. Kluwer Academic Publishers, Dordrecht, The Netherlands.
32. Shragowitz, E., S. Keel. 1987. A global router on a multi-commodity flow model. Interaction 5 3-16.
33. Soukup, J. 1978. Fast maze router. Proc. 15th Design Automation Conf. IEEE Press, Piscataway, NJ, 100-102.
34. Vanderbei, R. 1998. LOQO: An interior point code for quadratic programming. Technical report, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ.
35. Vanderbei, R., D. F. Shanno. 1997. An interior point algorithm for non-convex nonlinear programming. Technical Report SOR-97-21, School of Engineering and Operational Research, Princeton University, Princeton, NJ.
36. Vannelli, A. 1991. An adaptation of the interior point method for solving the global routing problem. IEEE Trans. Comput.-Aided Design Integrated Circuits Systems 10 193-203.
37. Vecchi, M. P., A. Kirkpatrick. 1983. Global wiring by simulated annealing. IEEE Trans. Comput.-Aided Design Integrated Circuits Systems 2 215-222.