Pages that link to "Travelling salesman problem"
The following pages link to Travelling salesman problem:
Displaying 21 items.
- Brian Kernighan (← links | edit)
- P versus NP problem (← links | edit)
- Computational complexity (← links | edit)
- Complexity (← links | edit)
- Computational complexity theory (← links | edit)
- George Dantzig (← links | edit)
- NP (complexity) (← links | edit)
- Genetic algorithm (← links | edit)
- Nearest neighbour algorithm (← links | edit)
- Operations research (← links | edit)
- Big O notation (← links | edit)
- List of computing and IT abbreviations (← links | edit)
- NP-hardness (← links | edit)
- Timeline of computing 1990–1999 (← links | edit)
- Greedy algorithm (← links | edit)
- St Hugh's College, Oxford (← links | edit)
- Algorithmic efficiency (← links | edit)
- Karl Menger (← links | edit)
- Hamiltonian path problem (← links | edit)
- Simulated annealing (← links | edit)
- Chinese postman problem (← links | edit)