Combinatorial Optimization by Stochastic Evolution

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 10, Issue 4, 1991, Pages 525-535

  Saab, Youssef G ^a   Rao, Vasant B ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; DECISION THEORY AND ANALYSIS; INTEGRATED CIRCUITS - COMPUTER AIDED DESIGN; MATHEMATICAL TECHNIQUES - COMBINATORIAL MATHEMATICS; OPERATIONS RESEARCH;

COMBINATORIAL OPTIMIZATION; NETWORK BISECTION; STANDARD CELL PLACEMENT; STOCHASTIC EVOLUTION; TRAVELING SALESMAN;

OPTIMIZATION;

EID: 0026136595     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.75636     Document Type: Article

References (33)

1. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Sci., vol. 220, pp. 671–680, May 1983.
2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman, 1979.
3. A. E. Dunlop and B. W. Kernighan, “A procedure for placement of standard-cell VLSI circuits,” IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 92–98, Jan. 1985.
4. D. La Potin and S. W. Director, “Mason: A global floorplanning approach for VLSI design,” IEEE Trans. Computer-Aided Design, vol. CAD-5, pp. 477–489, Oct. 1 1986.
5. M. A. Breuer, “Min-cut placement,” J. Design Automat. Fault-Tolerant Comput., vol. 1, no. 4, pp. 343–362, Oct. 1977.
6. B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell Syst. Tech. J., vol. 49, pp. 291-307, Feb. 1970.
7. E. R. Barnes, “An algorithm for partitioning the nodes of a graph,” SIAM J. Algebraic Discrete Methods, vol. 3, pp. 541-550, Dec. 1982.
8. R. Russo, P. Oden, and P. Wolff Sr., “A heuristic procedure for the partitioning and mapping of computer logic graphs,” IEEE Trans. Comput., vol. C-20, pp. 1455–1462, Dec. 1971.
9. T. Bui, S. Chaudhuri, T. Leighton, and M. Sipser, “Graph bisection algorithm with good average case behavior,” in Proc. 25th IEEE Symp. on Foundations of Computing, 1984, pp. 181–192.
10. C. Fiduccia and R. Mattheyes, “A linear-time heuristics for improving network partitions,” in Proc. 19th Design Automation Conf., Jan. 1982, pp. 175–181.
11. K. S. Arun and V. B. Rao, “A new principle-components algorithm for graph partitioning with application in VLSI placement problems,” Proc. 20th Asilomar Conf. on Signals, Systems, and Computers, Pacific Grove, CA, Nov. 1986.
12. P. Suaris and G. Kedem, “An algorithm for quadrisection and its application to standard cell placement,” IEEE Trans. Circuits Syst., vol. 35, Mar. 1988.
13. J. P. Blanks, “Near-optimal placement using a quadratic objective function,” in Proc. 21st Design Automation Conf., June 1985, pp. 602–615.
14. C. K. Cheng and E. S. Kuh, “Module placement based on resistive network optimization,” IEEE Trans. Computer-Aided Design, Mar. 1984.
15. R. M. Kling and P. Banerjee, “ESP: Placement by simulated evolution,” IEEE Trans. Computer-Aided Design, vol. 8, pp. 245–256, Mar. 1989.
16. C. Sechen and A. Sangiovanni-Vincentelli, “The Timberwolf placement and routing package,” IEEE J. Solid-State Circuits, vol. SC-20, pp. 510–522, Apr. 1985.
17. J. Lam and J. Delosme, “Simulated annealing: A fast heuristic for some generic layout problems,” Proc. Int. Conf. on Computer-Aided Design, Nov. 1988, pp. 510–513.
18. D. Jepsen and C. D. Gelatt, “Macro placement by Monte Carlo annealing,” in Proc. Int. Conf. on Computer-Aided Design, Sept. 1983, pp. 495–498.
19. F. Romeo and A. Sangiovanni-Vincentelli, “Probabilistic hill climbing algorithms: Properties and applications,” UCB/ERL M84/34, Univ. California, Berkeley, 1984.
20. M. Vecchi and S. Kirkpatrick, “Global wiring by simulated annealing,” IEEE Trans. Computer-Aided Design, vol. CAD-2, pp. 215–222, Oct. 1983.
21. B. Gidas, “Non-stationary Markov chains and convergence of the annealing algorithm,” J. Statistical Phys., vol. 39, pp. 73–131, 1985.
22. D. Mitra, F. Romeo, and A. Sangiovanni-Vincentelli, “Convergence and finite-time behavior of simulated annealing,” Advances Appl. Probability, vol. 18, pp. 747–771, 1986.
23. S. Nahar, S. Sahni, and E. Shragowitz, “Experiments with simulated annealing,” in Proc. 22nd Design Automation Conf., 1985, pp. 748–752.
24. S. Nahar, S. Sahni, and E. Shragowitz, “Simulated annealing and combinatorial optimization,” in Proc. 23rd Design Automation Conf., 1986, pp. 293–299.
25. B. Dunham, D. Fridshal, R. Fridshal, and J. North, “Design by natural selection,” Synthese. Dordrecht-Holland, D. Reidel, 1963, pp. 254–259.
26. J. Cohoon and W. Paris, “Genetic Placement,” in Proc. Int. Conf. on Computer-Aided Design, 1986, pp. 422–425.
27. S. Lin and B. W. Kernigham, “An effective heuristic algorithm for the traveling salesman problem,” Oper. Res., vol. 21, pp. 498–516, 1973.
28. B. Hajek, “Cooling schedules for optimal annealing,” Math. Oper. Res., vol. 13, no. 2, pp. 311–329, May 1988.
29. D. Connors and P. Kumar, “Simulated annealing and balance of recurrence order in time-inhomogeneous Markov chains,” in Proc. 26th Conf on Decision and Control, Dec. 1987, pp. 2261–2263.
30. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York: Wiley, 1988.
31. S. Kang, “Linear ordering and application to placement,” in Proc. 20th Design Automation Conf., 1983, pp. 457–464.
32. Y. Saab and V. Rao, “Linear ordering by stochastic evolution,” in Proc. 4th CSI/IEEE lnt. Symp. on VLSI Design, Jan. 1991, pp. 130–135.
33. IEEE/ACM SIGDA Physical Design Workshop: Placement and Floorplanning, Hilton Head, SC, Apr. 1987.