Pages that link to "Item:Q3387303"
From MaRDI portal
The following pages link to On One Routing Problem with Non-Additive Cost Aggregation (Q3387303):
Displaying 5 items.
- Non-additive shortest path in the context of traffic assignment (Q1754328) (← links)
- A Model of "Nonadditive" Routing Problem Where the Costs Depend on the Set of Pending Tasks (Q3451936) (← links)
- On sequential traversal of sets (Q5037478) (← links)
- One task of routing jobs in high radiation conditions (Q5067414) (← links)
- A bottleneck routing problem with a system of priority tasks (Q6169144) (← links)