Using local search to speed up filtering algorithms for some NP-hard constraints (Q545546)
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: Using local search to speed up filtering algorithms for some NP-hard constraints |
scientific article; zbMATH DE number 5911480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using local search to speed up filtering algorithms for some NP-hard constraints |
scientific article; zbMATH DE number 5911480 |
Statements
Using local search to speed up filtering algorithms for some NP-hard constraints (English)
0 references
22 June 2011
0 references
constraint programming
0 references
local search
0 references
graph coloring
0 references
