Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems (Q1204869)
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: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems |
scientific article; zbMATH DE number 146355
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems |
scientific article; zbMATH DE number 146355 |
Statements
Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems (English)
0 references
1 April 1993
0 references
heuristic
0 references
large-scale constraint satisfaction
0 references
min-conflicts heuristic
0 references
\(n\)-queens problem
0 references
0 references
