About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ICCAD 1987
Conference paper
Hill climbing with reduced search space
Abstract
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.