Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem (Q5111888)
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: Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem |
scientific article; zbMATH DE number 7205212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem |
scientific article; zbMATH DE number 7205212 |
Statements
27 May 2020
0 references
exact exponential algorithm
0 references
single-machine total tardiness
0 references
branch-and-merge
0 references
0 references
Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem (English)
0 references
0.954064667224884
0 references
0.7680802941322327
0 references
0.7642227411270142
0 references
0.7641499042510986
0 references
0.7641499042510986
0 references
