A Branch-and-Cut Method for Solving the Bilevel Clique Interdiction Problem

Simple item page
dc.contributor.advisorHicks, Illyaen_US
dc.contributor.committeeMemberZhang, Yinen_US
dc.contributor.committeeMemberMcLurkin, Jamesen_US
dc.creatorBecker, Timothy Jen_US
dc.date.accessioned2016-01-07T17:07:40Zen_US
dc.date.available2016-01-07T17:07:40Zen_US
dc.date.created2015-05en_US
dc.date.issued2015-04-20en_US
dc.date.submittedMay 2015en_US
dc.date.updated2016-01-07T17:07:40Zen_US
dc.description.abstractI introduce an algorithm to solve the current formulation of the bilevel clique interdiction problem. Interdiction, a military term, describes the removal of enemy resources. The single level clique interdiction problem describes the attempt of an attacker to interdict a maximum number of cliques. The bilevel form of the problem introduces a defender who attempts to minimize the number of cliques interdicted by the attacker. Previous authors have developed algorithms for the single level clique interdiction problem, as well as for bilevel formulations of other problems. However, an algorithm for the bilevel clique interdiction problem has not previously been creatd. The algorithm presented in this thesis uses a branch and cut approach to solve the proposed problem. This algorithm is expected to be usable on any social network, thereby improving the study of many network problems including terrorist cells or marketing strategies.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationBecker, Timothy J. "A Branch-and-Cut Method for Solving the Bilevel Clique Interdiction Problem." (2015) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/87748">https://hdl.handle.net/1911/87748</a>.en_US
dc.identifier.urihttps://hdl.handle.net/1911/87748en_US
dc.language.isoengen_US
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.en_US
dc.subjectCliqueen_US
dc.subjectInterdictionen_US
dc.subjectBranch-and-Cuten_US
dc.subjectGraph Theoryen_US
dc.subjectInteger Programmingen_US
dc.titleA Branch-and-Cut Method for Solving the Bilevel Clique Interdiction Problemen_US
dc.typeThesisen_US
dc.type.materialTexten_US
thesis.degree.departmentComputational and Applied Mathematicsen_US
thesis.degree.disciplineEngineeringen_US
thesis.degree.grantorRice Universityen_US
thesis.degree.levelMastersen_US
thesis.degree.nameMaster of Artsen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
BECKER-DOCUMENT-2015.pdf
Size:
1.08 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
PROQUEST_LICENSE.txt
Size:
5.84 KB
Format:
Plain Text
Description:
Download
No Thumbnail Available
Name:
LICENSE.txt
Size:
2.61 KB
Format:
Plain Text
Description:
Download
Collections
Rice University Theses and Dissertations