Pages that link to "Item:Q3451936"
From MaRDI portal
The following pages link to A Model of "Nonadditive" Routing Problem Where the Costs Depend on the Set of Pending Tasks (Q3451936):
Displaying 11 items.
- Route problem with constraints depending on a list of tasks (Q265955) (← links)
- Constrained optimal routing (Q542269) (← links)
- On a bottleneck routing problem (Q643816) (← links)
- A discrete-continuous routing problem with precedence constraints (Q721512) (← links)
- Extremal bottleneck routing problem with constraints in the form of precedence conditions (Q735643) (← links)
- On One Routing Problem with Non-Additive Cost Aggregation (Q3387303) (← links)
- Оptimization of the Start Point in the Gtsp with the Precedence Conditions (Q4963242) (← links)
- Dynamic programming in the generalized bottleneck problem and the start point optimization (Q5224167) (← links)
- Routing of displacements with dynamic constraints: “bottleneck problem” (Q5266472) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- A bottleneck routing problem with a system of priority tasks (Q6169144) (← links)