The following pages link to On a bottleneck routing problem (Q643816):
Displaying 4 items.
- Elements of dynamic programming in extremal routing problems (Q463354) (← links)
- Approximation schemes for the generalized traveling salesman problem (Q1744982) (← links)
- Dynamic programming in the routing problem with complex dependence of costs on the list of jobs (Q2263886) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)