Pages that link to "Travelling salesman problem"
Jump to navigation
Jump to search
The following pages link to Travelling salesman problem:
Displaying 50 items.
- Brian Kernighan (links)
- P versus NP problem (links)
- Computational complexity (links)
- Complexity (links)
- Computational complexity theory (links)
- George Dantzig (links)
- NP (complexity) (links)
- Genetic algorithm (links)
- Nearest neighbour algorithm (links)
- Operations research (links)
- Big O notation (links)
- List of computing and IT abbreviations (links)
- NP-hardness (links)
- Timeline of computing 1990–1999 (links)
- Greedy algorithm (links)
- St Hugh's College, Oxford (links)
- Algorithmic efficiency (links)
- Karl Menger (links)
- Hamiltonian path problem (links)
- Simulated annealing (links)
- Chinese postman problem (links)
- Seven Bridges of Königsberg (links)
- The Old Wives' Tale (links)
- Traveling salesperson problem (redirect page) (links)
- Hamiltonian path (links)
- Clique problem (links)
- Leonard Adleman (links)
- DNA computing (links)
- Richard M. Karp (links)
- Hill climbing (links)
- Genetic operator (links)
- Time complexity (links)
- Integer programming (links)
- Bottleneck traveling salesman problem (links)
- Combinatorial optimization (links)
- Branch and bound (links)
- Steiner tree problem (links)
- Crossover (evolutionary algorithm) (links)
- Chromosome (evolutionary algorithm) (links)
- Traveling Salesman Problem (redirect page) (links)
- Approximation algorithm (links)
- Ant colony optimization algorithms (links)
- TSP (links)
- Gödel Prize (links)
- Function problem (links)
- List of terms relating to algorithms and data structures (links)
- Metaheuristic (links)
- Cutting stock problem (links)
- Julia Robinson (links)
- Cubic graph (links)