\textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052)
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: \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees |
scientific article; zbMATH DE number 7350560
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees |
scientific article; zbMATH DE number 7350560 |
Statements
\textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (English)
0 references
21 May 2021
0 references
scheduling
0 references
exact algorithms
0 references
memorization
0 references
branch and memorize
0 references
sequencing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
