Back to results
University of Illinois at Urbana-Champaign
A Local Search Algorithm Approach to Analyzing the Complexity of Discrete Optimization Problems
Abstract
dc:descriptionThe properties of polynomially computable neighborhood functions are also examined. The global verification of several problems is proven to be NP-complete. These results are extended to show that polynomially computable neighborhood functions have arbitrarily poor local optima.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Industrial Engineering
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Armstrong, Derek Elswick
- Contributors dc:contributor
-
- Jacobson, Sheldon H.
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI3044043
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/87076