The generalized critical node detection problem

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.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Industrial Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2023

Author dc:creator

• Karajgikar, Vidhi S

Contributors dc:contributor

• Vogiatzis, Chrysafis

• Critical Nodes
• Network Interdiction
• Generalizations
• Combinatorial Optimization.

Statement dc:rights

• Copyright 2023 Vidhi Karajgikar

Language dc:language

en, eng

Handle dc:identifier

https://hdl.handle.net/2142/122258

OAI record oai:identifier

https://www.ideals.illinois.edu/oai-pmh?verb=GetRecord&metadataPrefix=etdms&identifier=oai%3Awww.ideals.illinois.edu%3A2142%2F122258