The maximum clique interdiction problem
From MaRDI portal
Publication:1735171
DOI10.1016/j.ejor.2019.02.028zbMath1430.90543OpenAlexW2916382463WikidataQ62048257 ScholiaQ62048257MaRDI QIDQ1735171
Ivana Ljubić, Fabio Furini, Pablo San Segundo, Sébastien Martin
Publication date: 28 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.02.028
combinatorial optimizationmaximum cliqueinterdiction problemsmost vital vertices(social) network analysis
Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Integer programming (90C10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Complexity of the multilevel critical node problem, Interdicting facilities in tree networks, A generic optimization framework for resilient systems, A Branch-and-Cut Algorithm for Submodular Interdiction Games, Integer Programming Formulations for Minimum Spanning Tree Interdiction, Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming, Integer programming methods for solving binary interdiction games, A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem, On designing networks resilient to clique blockers, A survey on mixed-integer programming techniques in bilevel optimization, A new branch-and-bound algorithm for the maximum edge-weighted clique problem, On integer and bilevel formulations for the \(k\)-vertex cut problem, CliSAT: a new exact algorithm for hard maximum clique problems, An exact method for binary fortification games, Mathematical programming formulations for the collapsed k-core problem, Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set, Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm, A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts, A branch-and-cut algorithm for the edge interdiction clique problem, A new branch-and-filter exact algorithm for binary constraint satisfaction problems, A Unified Framework for Multistage Mixed Integer Linear Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of algorithms for mixed-integer bilevel min-max optimization
- Finding optimal strategies in a multi-period multi-leader-follower Stackelberg game using an evolutionary algorithm
- The firefighter problem: empirical results on random graphs
- Infra-chromatic bound for exact maximum clique search
- A new exact maximum clique algorithm for large and massive sparse graphs
- The most vital nodes with respect to independent set and vertex cover
- An exact bit-parallel algorithm for the maximum clique problem
- Finding clique clusters with the highest betweenness centrality
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- The critical node detection problem in networks: a survey
- Propositional truth maintenance systems: Classification and complexity analysis
- An improved bit parallel exact maximum clique algorithm
- On clique relaxation models in network analysis
- Relaxed approximate coloring in exact maximum clique search
- Fast algorithms for determining (generalized) core groups in social networks
- Stochastic Network Interdiction
- Risk-Averse Shortest Path Interdiction
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- Bilevel Knapsack with Interdiction Constraints
- Finding a Maximum Clique in an Arbitrary Graph
- Finding the n Most Vital Links in Flow Networks
- Firefighting on Trees Beyond Integrality Gaps
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
- Minimum vertex blocker clique problem
- Two-Person Zero-Sum Games for Network Interdiction
- Automata, Languages and Programming
