Files in this item

FilesDescriptionFormat

application/pdf

application/pdf3044043.pdf (8MB)Restricted to U of Illinois
(no description provided)PDF

Description

Title:A Local Search Algorithm Approach to Analyzing the Complexity of Discrete Optimization Problems
Author(s):Armstrong, Derek Elswick
Doctoral Committee Chair(s):Jacobson, Sheldon H.
Department / Program:Industrial Engineering
Discipline:Industrial Engineering
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:Ph.D.
Genre:Dissertation
Subject(s):Operations Research
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.
Issue Date:2002
Type:Text
Language:English
Description:178 p.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.
URI:http://hdl.handle.net/2142/87076
Other Identifier(s):(MiAaPQ)AAI3044043
Date Available in IDEALS:2015-09-28
Date Deposited:2002


This item appears in the following Collection(s)

Item Statistics