A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7479751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new branch-and-filter exact algorithm for binary constraint satisfaction problems |
scientific article; zbMATH DE number 7479751 |
Statements
A new branch-and-filter exact algorithm for binary constraint satisfaction problems (English)
0 references
23 February 2022
0 references
combinatorial optimization
0 references
binary constraint satisfaction problems
0 references
constraint programming
0 references
exact algorithm
0 references
computational experiments
0 references
0 references
0 references
0 references
0 references
0.7643958330154419
0 references
0.7425989508628845
0 references
0.7280080318450928
0 references
0.7259507179260254
0 references
0.7232806086540222
0 references
