Pages that link to "Item:Q2261746"
From MaRDI portal
The following pages link to On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs (Q2261746):
Displaying 12 items.
- Route problem with constraints depending on a list of tasks (Q265955) (← links)
- Dynamic programming in the routing problem with constraints and costs depending on a list of tasks (Q403862) (← links)
- Elements of dynamic programming in extremal routing problems (Q463354) (← links)
- Routing under constraints: problem of visit to megalopolises (Q510285) (← links)
- Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints (Q2362374) (← links)
- Generalized Model of Courier with Additional Restrictions (Q2806800) (← links)
- On one routing problem modeling movement in radiation fields (Q4961696) (← links)
- On sequential traversal of sets (Q5037478) (← links)
- Optimizing multi-inserts in routing problems with constraints (Q5114290) (← links)
- OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS (Q5125218) (← links)
- Dynamic programming in the generalized bottleneck problem and the start point optimization (Q5224167) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
