A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
Abstract We study the Knapsack Problem with Conflicts, a generalization of the Knapsack
Problem in which a set of conflicts specifies pairs of items which cannot be simultaneously …
Problem in which a set of conflicts specifies pairs of items which cannot be simultaneously …
A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms
This manuscript provides a comprehensive review of the Maximum Clique Problem, a
computational problem that involves finding subsets of vertices in a graph that are all …
computational problem that involves finding subsets of vertices in a graph that are all …
A new exact maximum clique algorithm for large and massive sparse graphs
P San Segundo, A Lopez, PM Pardalos - Computers & Operations …, 2016 - Elsevier
This paper describes a new very efficient branch-and-bound exact maximum clique
algorithm BBMCSP, designed for large and massive sparse graphs which appear frequently …
algorithm BBMCSP, designed for large and massive sparse graphs which appear frequently …
Why is maximum clique often easy in practice?
JL Walteros, A Buchanan - Operations Research, 2020 - pubsonline.informs.org
To this day, the maximum clique problem remains a computationally challenging problem.
Indeed, despite researchers' best efforts, there exist unsolved benchmark instances with …
Indeed, despite researchers' best efforts, there exist unsolved benchmark instances with …
Efficient algorithms for finding maximum and maximal cliques and their applications
E Tomita - … and Computation: 11th International Conference and …, 2017 - Springer
The problem of finding a maximum clique or enumerating all maximal cliques is very
important and has been explored in several excellent survey papers. Here, we focus our …
important and has been explored in several excellent survey papers. Here, we focus our …
The maximum clique interdiction problem
Given a graph G and an interdiction budget k, the Maximum Clique Interdiction Problem
asks to find a subset of at most k vertices to remove from G so that the size of the maximum …
asks to find a subset of at most k vertices to remove from G so that the size of the maximum …
A branch-and-cut algorithm for the edge interdiction clique problem
Given a graph G and an interdiction budget k∈ N, the Edge Interdiction Clique Problem
(EICP) asks to find a subset of at most k edges to remove from G so that the size of the …
(EICP) asks to find a subset of at most k edges to remove from G so that the size of the …
[HTML][HTML] CliSAT: A new exact algorithm for hard maximum clique problems
Given a graph, the maximum clique problem (MCP) asks for determining a complete
subgraph with the largest possible number of vertices. We propose a new exact algorithm …
subgraph with the largest possible number of vertices. We propose a new exact algorithm …
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
We study the maximum edge-weighted clique problem, a problem related to the maximum
(vertex-weighted) clique problem which asks for finding a complete subgraph (ie, a clique) of …
(vertex-weighted) clique problem which asks for finding a complete subgraph (ie, a clique) of …
Clique and constraint models for maximum common (connected) subgraph problems
C McCreesh, SN Ndiaye, P Prosser… - … Conference on Principles …, 2016 - Springer
The maximum common subgraph problem is to find the largest subgraph common to two
given graphs. This problem can be solved either by constraint-based search, or by reduction …
given graphs. This problem can be solved either by constraint-based search, or by reduction …