Referenced Items are not available for this document.
A general optimization algorithm, which in some areas successfully competes with simulated annealing and the Kernighan-Lin algorithm, as well as special heuristics, is presented. It gains speed by taking advantage of the structure of the objective function in order to reduce the search space. Results obtained from the implementation of the algorithm on three problems are presented.<
Published in:
Computer-Aided Design, 1988. ICCAD-88. Digest of Technical Papers., IEEE International Conference on
Date of Conference: 7-10 Nov. 1988
- Page(s):
- 294 - 297
- Meeting Date :
- 07 Nov 1988-10 Nov 1988
- Print ISBN:
- 0-8186-0869-2
- INSPEC Accession Number:
- 3350265
- Conference Location :
- Santa Clara, CA, USA
- Digital Object Identifier :
- 10.1109/ICCAD.1988.122514
- Product Type:
- Conference Publications
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.
