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

Journal Title
Journal ISSN
Volume Title

I 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.

Master of Arts
Clique, Interdiction, Branch-and-Cut, Graph Theory, Integer Programming

Becker, Timothy J. "A Branch-and-Cut Method for Solving the Bilevel Clique Interdiction Problem." (2015) Master’s Thesis, Rice University. https://hdl.handle.net/1911/87748.

Has part(s)
Forms part of
Published Version
Copyright 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.
Link to license
Citable link to this page