Dynamic Programming: Salesman to Surgeon
Dynamic Programming is an optimization technique used in computer science and mathematics. Introduced in the 1950s, it has been applied to many classic combinatorial optimization problems, such as the Shortest Path Problem, the Knapsack Problem, and the Traveling Salesman Problem, with varying degre...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/7526 |