The following pages link to (Q3693290):
Displaying 21 items.
- The traveling salesman problem with flexible coloring (Q444446) (← links)
- On the nearest neighbor rule for the metric traveling salesman problem (Q496440) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Pyramidal tours and the traveling salesman problem (Q809904) (← links)
- Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP (Q935238) (← links)
- On the domino-parity inequalities for the STSP (Q985309) (← links)
- Experimentation in optimization (Q1084342) (← links)
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation (Q1118536) (← links)
- Analysis of Christofides' heuristic: some paths are more difficult than cycles (Q1180833) (← links)
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514) (← links)
- Nearest-neighbour heuristics in accelerated algorithms of optimisation problems (Q1330318) (← links)
- Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
- Divide and conquer strategies for parallel TSP heuristics (Q1919776) (← links)
- A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality (Q2009011) (← links)
- Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem (Q2367039) (← links)
- Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio (Q2839206) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
- Optimization of logistics services in hospitals (Q4608286) (← links)
- The travelling salesman and the PQ-tree (Q4645944) (← links)
- THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS (Q5051225) (← links)
- Truly tight bounds for TSP heuristics (Q6047697) (← links)
