Pages that link to "Item:Q4016908"
From MaRDI portal
The following pages link to The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem (Q4016908):
Displaying 13 items.
- A note on the complexity of local search problems (Q673814) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- On total functions, existence theorems and computational complexity (Q808245) (← links)
- A new adaptive multi-start technique for combinatorial global optimizations (Q1342281) (← links)
- Finding optimal subgraphs by local search (Q1392027) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Computational aspects of the colorful Carathéodory theorem (Q1991350) (← links)
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (Q2441587) (← links)
- Memetic algorithms: The polynomial local search complexity theory perspective (Q2481603) (← links)
- The complexity of searching implicit graphs (Q2676567) (← links)
- On the distributed decision-making complexity of the minimum vertex cover problem (Q3126012) (← links)
- The complexity of searching succinctly represented graphs (Q4645179) (← links)
