Referenced Items are not available for this document.
A novel technique is introduced, called stochastic evolution (SE), for solving a wide range of combinatorial optimization problems. It is shown that SE can be specifically tailored to solve the network bisection, traveling salesman, and standard cell placement problems. Experimental results for these problems show that SE can produce better quality solutions than sophisticated simulated annealing (SA)-based heuristics in a much shorter computation time
Published in:
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
(Volume:10
,
Issue:
4
)
Date of Publication: Apr 1991
- Page(s):
- 525 - 535
- ISSN :
- 0278-0070
- INSPEC Accession Number:
- 3918618
- Digital Object Identifier :
- 10.1109/43.75636
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Apr 1991
- Sponsored by :
- IEEE Council on Electronic Design Automation
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
