The following pages link to The Traveling-Salesman Problem (Q5378674):
Displayed 23 items.
- An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
- Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
- An optimization approach for communal home meal delivery service: A case study (Q837090) (← links)
- Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia (Q857313) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems (Q878570) (← links)
- Golden ratio versus pi as random sequence sources for Monte Carlo integration (Q949528) (← links)
- Truncated \(M\)-travelling salesman problem (Q998696) (← links)
- An improved assignment lower bound for the Euclidean traveling salesman problem (Q1058993) (← links)
- Submodularity and the traveling salesman problem (Q1124707) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient (Q1226033) (← links)
- Stochastic vehicle routing (Q1266554) (← links)
- New edges not used in shortest tours of TSP (Q1291639) (← links)
- The convex-hull-and-line traveling salesman problem: A solvable case (Q1332749) (← links)
- The Convex-hull-and-k-line Travelling Salesman Problem (Q1350909) (← links)
- A bilevel programming approach to the travelling salesman problem. (Q1426728) (← links)
- A new hybrid heuristic approach for solving large traveling salesman problem (Q1886765) (← links)
- A travelling salesman problem (TSP) with multiple job facilities. (Q2467832) (← links)
- Time-dependent travelling salesman problem. (Q2476429) (← links)
- First vs. best improvement: an empirical study (Q2489903) (← links)
- The traveling salesman problem with few inner points (Q2583717) (← links)
- Discrete Set Handling (Q3649627) (← links)