Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336)
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: Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding |
scientific article; zbMATH DE number 7540586
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding |
scientific article; zbMATH DE number 7540586 |
Statements
Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (English)
0 references
13 June 2022
0 references
precedence constraints
0 references
travelling salesman
0 references
sequential ordering problem
0 references
dynamic programming
0 references
brand-and-bound
0 references
parallelism
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
