Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169)
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 7634102
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems |
scientific article; zbMATH DE number 7634102 |
Statements
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (English)
0 references
19 December 2022
0 references
combinatorial optimization
0 references
Monte Carlo tree search
0 references
quay crane scheduling problem with non-crossing constraints
0 references
0-1 knapsack problem
0 references
0 references
0 references
0 references
0.7677698731422424
0 references
0.7248449325561523
0 references
0.7175195217132568
0 references
0.7163106203079224
0 references
0.7156398296356201
0 references
