TreeDQN: Learning to minimize Branch-and-Bound tree (Q6439785)
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: TreeDQN: Learning to minimize Branch-and-Bound tree |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | TreeDQN: Learning to minimize Branch-and-Bound tree |
preprint article from arXiv |
Statements
9 June 2023
0 references
cs.LG
0 references
math.OC
0 references
Dmitry Sorokin
0 references
Alexander Kostin
0 references
