Pages that link to "Item:Q403862"

The following pages link to Dynamic programming in the routing problem with constraints and costs depending on a list of tasks (Q403862):

Displaying 9 items.

• Route problem with constraints depending on a list of tasks (Q265955) (← links)
• Elements of dynamic programming in extremal routing problems (Q463354) (← links)
• Routing under constraints: problem of visit to megalopolises (Q510285) (← links)
• A discrete-continuous routing problem with precedence constraints (Q721512) (← links)
• On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks (Q2071605) (← links)
• Optimizing insertions in a constraint routing problem with complicated cost functions (Q2290475) (← links)
• Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints (Q2362374) (← links)
• An exact algorithm with linear complexity for a problem of visiting megalopolises (Q2396369) (← links)
• On the question of the optimization of permutations in the problem with dynamic constraints (Q5114333) (← links)