A Model of "Nonadditive" Routing Problem Where the Costs Depend on the Set of Pending Tasks (Q3451936)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Model of "Nonadditive" Routing Problem Where the Costs Depend on the Set of Pending Tasks |
scientific article |
Statements
A Model of "Nonadditive" Routing Problem Where the Costs Depend on the Set of Pending Tasks (English)
0 references
18 November 2015
0 references
dynamic programming
0 references
route
0 references
precedence constraints
0 references
sequential ordering problem
0 references
