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 this page instead for the normal view: A new branch-and-filter exact algorithm for binary constraint satisfaction problems |
scientific article; zbMATH DE number 7479751
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
