• DOI:10.1007/3-540-58484-6_259
Corpus ID: 34802650

Long Path Problems

@inproceedings{Horn1994LongPP,
  title={Long Path Problems},
  author={J. Horn and D. Goldberg and K. Deb},
  booktitle={PPSN},
  year={1994}
}

J. Horn, D. Goldberg, K. Deb

Published in PPSN 1994

Mathematics, Computer Science

We demonstrate the interesting, counter-intuitive result that simple paths to the global optimum can be so long that climbing the path is intractable. This means that a unimodal search space, which consists of a single hill and in which each point in the space is on a simple path to the global optimum, can be difficult for a hillclimber to optimize. Various types of hillclimbing algorithms will make constant progress toward the global optimum on such long path problems. They will continuously… CONTINUE READING

View via Publisher

repository.ias.ac.in

Save to Library

Create Alert

Cite

Launch Research Feed