Related references
Note: Only part of the references are listed.A new branch-and-filter exact algorithm for binary constraint satisfaction problems
Pablo San Segundo et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
Stefano Coniglio et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)
A branch-and-cut algorithm for the Edge Interdiction Clique Problem
Fabio Furini et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)
Why Is Maximum Clique Often Easy in Practice?
Jose L. Walteros et al.
OPERATIONS RESEARCH (2020)
The maximum clique interdiction problem
Fabio Furini et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem
Pablo San Segundo et al.
COMPUTERS & OPERATIONS RESEARCH (2019)
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
Pablo San Segundo et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)
Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms
Sandor Szabo et al.
INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS (2019)
A new upper bound for the maximum weight clique problem
Chu-Min Li et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2018)
Incremental Upper Bound for the Maximum Clique Problem
Chu-Min Li et al.
INFORMS JOURNAL ON COMPUTING (2018)
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
Andrea Bettinelli et al.
INFORMS JOURNAL ON COMPUTING (2017)
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
Chu-Min Li et al.
COMPUTERS & OPERATIONS RESEARCH (2017)
Improved initial vertex ordering for exact maximum clique search
Pablo San Segundo et al.
APPLIED INTELLIGENCE (2016)
A new exact maximum clique algorithm for large and massive sparse graphs
Pablo San Segundo et al.
COMPUTERS & OPERATIONS RESEARCH (2016)
Improved Infra-Chromatic Bound for Exact Maximum Clique Search
Pablo San Segundo et al.
INFORMATICA (2016)
A novel clique formulation for the visual feature matching problem
Pablo San Segundo et al.
APPLIED INTELLIGENCE (2015)
Infra-chromatic bound for exact maximum clique search
Pablo San Segundo et al.
COMPUTERS & OPERATIONS RESEARCH (2015)
A review on algorithms for maximum clique problems
Qinghua Wu et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)
Relaxed approximate coloring in exact maximum clique search
Pablo San Segundo et al.
COMPUTERS & OPERATIONS RESEARCH (2014)
Speeding up branch and bound algorithms for solving the maximum clique problem
Evgeny Maslov et al.
JOURNAL OF GLOBAL OPTIMIZATION (2014)
Robust Global Feature Based Data Association With a Sparse Bit Optimized Maximum Clique Algorithm
Pablo San Segundo et al.
IEEE TRANSACTIONS ON ROBOTICS (2013)
An adaptive multistart tabu search approach to solve the maximum clique problem
Qinghua Wu et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2013)
An improved bit parallel exact maximum clique algorithm
Pablo San Segundo et al.
OPTIMIZATION LETTERS (2013)
An exact bit-parallel algorithm for the maximum clique problem
Pablo San Segundo et al.
COMPUTERS & OPERATIONS RESEARCH (2011)
Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver
Pablo San Segundo et al.
APPLIED INTELLIGENCE (2010)
A survey on vertex coloring problems
Enrico Malaguti et al.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2010)
A fast algorithm for the maximum clique problem
PRJ Östergård
DISCRETE APPLIED MATHEMATICS (2002)
Benchmarking optimization software with performance profiles
ED Dolan et al.
MATHEMATICAL PROGRAMMING (2002)
Share Paper
