This item's files can only be accessed by the System Administrators group.
Permalink
https://hdl.handle.net/2142/122258
Description
Title
The generalized critical node detection problem
Author(s)
Karajgikar, Vidhi S
Issue Date
2023-12-08
Director of Research (if dissertation) or Advisor (if thesis)
Vogiatzis, Chrysafis
Department of Study
Industrial&Enterprise Sys Eng
Discipline
Industrial Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S.
Degree Level
Thesis
Keyword(s)
critical nodes
network interdiction
generalizations
combinatorial optimization.
Abstract
In this thesis, we introduce the Generalized Critical Node Detection Problem (GCNP). Generalizations of various combinatorial optimization problems such as the Travelling Salesperson Problem, Subset Assignment Problem, and Vehicle Routing Problem, among others, have been proposed and studied for their structural properties, formulations, solution methodologies, and applications. The critical node problem is a well-known problem in the categories of network optimization and interdiction problems. The purpose of this thesis is three-fold: 1. To introduce the GCNP along with formulations and preliminary solution analyses. 2. To provide a review of relevant literature pertaining to the critical node detection problem and generalizations. 3. To mention prospective applications of the critical node problem that can be extended to study the GCNP. This should encourage interested readers to explore this problem further.
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.
