The following pages link to (Q4801179):
Displayed 9 items.
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- The on-line asymmetric traveling salesman problem (Q935844) (← links)
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP (Q1348379) (← links)
- Upper bounds on ATSP neighborhood size. (Q1406047) (← links)
- Embedded local search approaches for routing optimization (Q1886851) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- Determination of the candidate arc set for the asymmetric traveling salesman problem (Q2485161) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5899416) (← links)