CliSAT : a new exact algorithm for hard maximum clique problems
Year of publication: |
2023
|
---|---|
Authors: | San Segundo, Pablo ; Furini, Fabio ; Álvarez, David ; Pardalos, Panos M. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 307.2023, 3 (16.6.), p. 1008-1025
|
Subject: | Branch-and-bound algorithm | Combinatorial optimization | Exact algorithm | Maximum clique problem | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research |
-
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano, (2021)
-
An exact algorithm for the block relocation problem with a stowage plan
Tanaka, Shunji, (2019)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
- More ...
-
A branch-and-cut algorithm for the Edge Interdiction Clique Problem
Furini, Fabio, (2021)
-
A new branch-and-filter exact algorithm for binary constraint satisfaction problems
San Segundo, Pablo, (2022)
-
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano, (2021)
- More ...