1. Home
  2. Issues
  3. Volume 27, Issue 2 (2016)
  4. Improved Infra-Chromatic Bound for Exact ...

Informatica


Cited by 5
Improved Infra-Chromatic Bound for Exact Maximum Clique Search

A branch-and-cut algorithm for the Edge Interdiction Clique Problem
Fabio Furini, Ivana Ljubić, Pablo San Segundo, Yanlu Zhao
https://doi.org/10.1016/j.ejor.2021.01.030
Journal:  European Journal of Operational Research Volume 294, Issue 1 (2021), p. 54
A maximum edge-weight clique extraction algorithm based on branch-and-bound
Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda
https://doi.org/10.1016/j.disopt.2020.100583
Journal:  Discrete Optimization Volume 37 (2020), p. 100583
A new branch-and-filter exact algorithm for binary constraint satisfaction problems
Pablo San Segundo, Fabio Furini, Rafael León
https://doi.org/10.1016/j.ejor.2021.09.014
Journal:  European Journal of Operational Research Volume 299, Issue 2 (2022), p. 448
CliSAT: A new exact algorithm for hard maximum clique problems
Pablo San Segundo, Fabio Furini, David Álvarez, Panos M. Pardalos
https://doi.org/10.1016/j.ejor.2022.10.028
Journal:  European Journal of Operational Research Volume 307, Issue 3 (2023), p. 1008
The maximum clique interdiction problem
Fabio Furini, Ivana Ljubić, Sébastien Martin, Pablo San Segundo
https://doi.org/10.1016/j.ejor.2019.02.028
Journal:  European Journal of Operational Research Volume 277, Issue 1 (2019), p. 112


Share


RSS