A new branch-and-filter exact algorithm for binary constraint satisfaction problems
Year of publication: |
2022
|
---|---|
Authors: | San Segundo, Pablo ; Furini, Fabio ; León, Rafael |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 299.2022, 2 (1.6.), p. 448-467
|
Subject: | Binary constraint satisfaction problems | Combinatorial optimization | Computational experiments | Constraint programming | Exact algorithm | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Schnell, Alexander, (2017)
-
CliSAT : a new exact algorithm for hard maximum clique problems
San Segundo, Pablo, (2023)
-
A fully polynomial time approximation scheme for the probability maximizing shortest path problem
Lee, Jisun, (2022)
- More ...
-
The maximum clique interdiction problem
Furini, Fabio, (2019)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano, (2021)
- More ...