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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem |
-
CliSAT : a new exact algorithm for hard maximum clique problems
San Segundo, Pablo, (2023)
-
Achieving domain consistency and counting solutions for dispersion constraints
Pesant, Gilles, (2015)
-
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
Ćwik, Michał, (2018)
- More ...
-
A branch-and-cut algorithm for the Edge Interdiction Clique Problem
Furini, Fabio, (2021)
-
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano, (2021)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
- More ...