Pages that link to "Item:Q5943078"

The following pages link to Solving the asymmetric travelling salesman problem with time windows by branch-and-cut (Q5943078):

Displaying 2 items.

• Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
• Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm (Q2414451) (← links)