A Local Search Algorithm Approach to Analyzing the Complexity of Discrete Optimization Problems
Armstrong, Derek Elswick
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/87076
Description
Title
A Local Search Algorithm Approach to Analyzing the Complexity of Discrete Optimization Problems
Author(s)
Armstrong, Derek Elswick
Issue Date
2002
Doctoral Committee Chair(s)
Jacobson, Sheldon H.
Department of Study
Industrial Engineering
Discipline
Industrial Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Operations Research
Language
eng
Abstract
The 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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
