The following pages link to (Q4138484):
Displaying 9 items.
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- On the stochastic complexity of the asymmetric traveling salesman problem (Q915656) (← links)
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (Q1118534) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- A note on the complexity of the asymmetric traveling salesman problem (Q1374382) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- A restricted Lagrangean approach to the traveling salesman problem (Q3911684) (← links)
