A branch-and-cut algorithm for the edge interdiction clique problem
From MaRDI portal
Publication:2031072
DOI10.1016/j.ejor.2021.01.030zbMath1487.90618OpenAlexW3126009794MaRDI QIDQ2031072
Pablo San Segundo, Ivana Ljubić, Yanlu Zhao, Fabio Furini
Publication date: 8 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/32473/1/32473.pdf
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A Branch-and-Cut Algorithm for Submodular Interdiction Games, Integer programming methods for solving binary interdiction games, Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem, Exact solution approaches for a class of bilevel fractional programs, A survey on mixed-integer programming techniques in bilevel optimization, 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, A new branch-and-filter exact algorithm for binary constraint satisfaction problems
Uses Software
Cites Work
- Unnamed Item
- A class of algorithms for mixed-integer bilevel min-max optimization
- Infra-chromatic bound for exact maximum clique search
- A new exact maximum clique algorithm for large and massive sparse graphs
- An adaptive multistart tabu search approach to solve the maximum clique problem
- An exact approach for the vertex coloring problem
- Solving vertex coloring problems as maximum weight stable set problems
- An exact bit-parallel algorithm for the maximum clique problem
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Local branching
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications
- Thinning out Steiner trees: a node-based model for uniform edge costs
- The maximum clique interdiction problem
- A dynamic reformulation heuristic for generalized interdiction problems
- A new upper bound for the maximum weight clique problem
- An improved bit parallel exact maximum clique algorithm
- A new branch-and-bound algorithm for the maximum weighted clique problem
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- The generalized reserve set covering problem with connectivity and buffer requirements
- Relaxed approximate coloring in exact maximum clique search
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- A survey on vertex coloring problems
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- Minimum vertex blocker clique problem
- Incremental Upper Bound for the Maximum Clique Problem
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
