The salesman and the tree: the importance of search in CP (Q272000)
From MaRDI portal
!
WARNING
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 6570965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The salesman and the tree: the importance of search in CP |
scientific article; zbMATH DE number 6570965 |
Statements
The salesman and the tree: the importance of search in CP (English)
0 references
20 April 2016
0 references
constraint programming
0 references
search
0 references
global constraints
0 references
operational research
0 references
traveling salesman problem
0 references
0.7594602704048157
0 references
0.7584220767021179
0 references
0.7534790635108948
0 references
0.7534790635108948
0 references
0.7491151094436646
0 references
