A branch-and-cut algorithm for the edge interdiction clique problem
type: Item
instance of: scholarly article
title: A branch-and-cut algorithm for the edge interdiction clique problem
zbMATH Open document ID: 1487.90618
author: Fabio Furini
author: Ivana Ljubić
author: Pablo San Segundo
author: Yanlu Zhao
published in: European Journal of Operational Research
publication date: 2021-06-08T00:00:00Z
full work available at URL: 32473.pdf
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7356517
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: interdiction problems
zbMATH Keywords: maximum clique
zbMATH Keywords: most vital edges
describes a project that uses: SURF
describes a project that uses: DIMACS
describes a project that uses: BBMCL
describes a project that uses: SIFT
describes a project that uses: BBMCSP
MaRDI profile type: Publication
OpenAlex ID: W3126009794
cites work: The generalized reserve set covering problem with connectivity and buffer requirements
cites work: A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
cites work: Solving vertex coloring problems as maximum weight stable set problems
cites work: Thinning out Steiner trees: a node-based model for uniform edge costs
cites work: A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
cites work: Interdiction Games and Monotonicity, with Application to Knapsack Problems
cites work: Local branching
cites work: A dynamic reformulation heuristic for generalized interdiction problems
cites work: Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
cites work: The maximum clique interdiction problem
cites work: On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
cites work: Discrete optimization with interval data. Minmax regret and fuzzy approach
cites work: Incremental Upper Bound for the Maximum Clique Problem
cites work: A new upper bound for the maximum weight clique problem
cites work: An exact approach for the vertex coloring problem
cites work: A survey on vertex coloring problems
cites work: Minimum vertex blocker clique problem
cites work: A new branch-and-bound algorithm for the maximum edge-weighted clique problem
cites work: A new branch-and-bound algorithm for the maximum weighted clique problem
cites work: A new exact maximum clique algorithm for large and massive sparse graphs
cites work: An improved bit parallel exact maximum clique algorithm
cites work: Infra-chromatic bound for exact maximum clique search
cites work: An exact bit-parallel algorithm for the maximum clique problem
cites work: Q4640250
cites work: Relaxed approximate coloring in exact maximum clique search
cites work: A class of algorithms for mixed-integer bilevel min-max optimization
cites work: An adaptive multistart tabu search approach to solve the maximum clique problem
DOI: 10.1016/J.EJOR.2021.01.030
description: scientific article; zbMATH DE number 7356517