{"id":{"repo_id":"buffalo","oai_identifier":"oai:ubir.buffalo.edu:10477/86488"},"canonical_url":"https://search.dev.ndltd.org/etd/buffalo/oai:ubir.buffalo.edu:10477/86488","repository":{"repo_id":"buffalo","name":"Buffalo","base_url":"https://ubir.buffalo.edu/oai/request"},"display":{"title":"Integer Programming Methods for Boolean Interdiction Games","abstract":"Ph.D.","abstract_html":"Ph.D.","abstract_has_math":false,"creators":["Wei, Ningji; 0000-0002-2045-0979"],"institution":"State University of New York at Buffalo","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Walteros, Jose","Industrial and Systems Engineering"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025-02-21T17:22:55Z","date_published":"2025-02-21T17:22:55Z","updated_at":"2026-07-27T19:05:32Z","subjects":["operations research"],"languages":["eng"],"rights":["Users of works found in University at Buffalo Institutional Repository (UBIR) are responsible for identifying and contacting the copyright owner for permission to reuse. University at Buffalo Libraries do not manage rights for copyright-protected works and cannot assist with permissions.","Copyright retained by author."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10477/86488","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Walteros, Jose","Industrial and Systems Engineering"]},{"key":"dc:creator","label":"Author","values":["Wei, Ningji; 0000-0002-2045-0979"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2025-02-21T17:22:55Z","2020"]},{"key":"dc:publisher","label":"Institution","values":["State University of New York at Buffalo"]},{"key":"dc:type","label":"Dc Type","values":["Text","Dissertation"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["operations research"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Users of works found in University at Buffalo Institutional Repository (UBIR) are responsible for identifying and contacting the copyright owner for permission to reuse. University at Buffalo Libraries do not manage rights for copyright-protected works and cannot assist with permissions.","Copyright retained by author."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/10477/86488"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Ph.D.","Interdiction games are commonly used to model scenarios where two actors with conflicting objectives both aim to operate optimally. We define an abstract game called the Boolean interdiction that captures the essence of an important subclass of these interdiction games. Then, we use an application, the resiliency analysis of information distribution policies, to demonstrate the benefits of integrating interdiction techniques in other research areas. To study the Boolean interdiction game, we start with an interesting graph interdiction game, the minimum spanning tree interdiction, in which we developed several new tools: a set-covering formulation that interdicts all the critical spanning trees, a class of facets that enhances the efficiency of the searching procedure, and a family of special graph structures that results in a new solution method based on supervalid inequities. With the aid of these new tools, we study the Boolean interdiction game in full generality. First, we discover that under mild assumptions, all the single/double ground sets based Boolean interdiction can be modeled by a neat set-covering formulation. Second, we develop a large class of valid inequities, which unifies many previously identified structures in literature, to strengthen the set-covering formulation and all its instance problems. Last, we developed the theory of conditional critical structures, a new method based on the idea of partitioning the solution space into an easy part and a difficult part, then use the former to produce constraints for the latter. We identify the realizations of these structures in various instance problems and develop a general implementation framework. As a result, many current methods for solving interdiction problems can benefit from these developments. Moreover, the idea behind the conditional critical structures can be extended to other optimization problems.","**To request an accessible version of the file(s) associated with this item, contact library@buffalo.edu. Please include the item's persistent URL [http://hdl.handle.net/. . .] in your request.**"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Integer Programming Methods for Boolean Interdiction Games"]}]}],"canonical_facts":{"dc:contributor":["Walteros, Jose","Industrial and Systems Engineering"],"dc:creator":["Wei, Ningji; 0000-0002-2045-0979"],"dc:date":["2025-02-21T17:22:55Z","2020"],"dc:description":["Ph.D.","Interdiction games are commonly used to model scenarios where two actors with conflicting objectives both aim to operate optimally. We define an abstract game called the Boolean interdiction that captures the essence of an important subclass of these interdiction games. Then, we use an application, the resiliency analysis of information distribution policies, to demonstrate the benefits of integrating interdiction techniques in other research areas. To study the Boolean interdiction game, we start with an interesting graph interdiction game, the minimum spanning tree interdiction, in which we developed several new tools: a set-covering formulation that interdicts all the critical spanning trees, a class of facets that enhances the efficiency of the searching procedure, and a family of special graph structures that results in a new solution method based on supervalid inequities. With the aid of these new tools, we study the Boolean interdiction game in full generality. First, we discover that under mild assumptions, all the single/double ground sets based Boolean interdiction can be modeled by a neat set-covering formulation. Second, we develop a large class of valid inequities, which unifies many previously identified structures in literature, to strengthen the set-covering formulation and all its instance problems. Last, we developed the theory of conditional critical structures, a new method based on the idea of partitioning the solution space into an easy part and a difficult part, then use the former to produce constraints for the latter. We identify the realizations of these structures in various instance problems and develop a general implementation framework. As a result, many current methods for solving interdiction problems can benefit from these developments. Moreover, the idea behind the conditional critical structures can be extended to other optimization problems.","**To request an accessible version of the file(s) associated with this item, contact library@buffalo.edu. Please include the item's persistent URL [http://hdl.handle.net/. . .] in your request.**"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/10477/86488"],"dc:language":["eng"],"dc:publisher":["State University of New York at Buffalo"],"dc:rights":["Users of works found in University at Buffalo Institutional Repository (UBIR) are responsible for identifying and contacting the copyright owner for permission to reuse. University at Buffalo Libraries do not manage rights for copyright-protected works and cannot assist with permissions.","Copyright retained by author."],"dc:subject":["operations research"],"dc:title":["Integer Programming Methods for Boolean Interdiction Games"],"dc:type":["Text","Dissertation"]},"updated_at":"2026-07-27T19:05:32Z"}