Skip to content

Usman Sharif

If it's not fun, you're doing it wrong

Category: Combinatorial Optimizations

The Traveling Salesman Problem – The Greedy Approach

The Traveling Salesman Problem (TSP) is an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science. … More

Blog at WordPress.com.
  • Follow Following
    • Usman Sharif
    • Already have a WordPress.com account? Log in now.
    • Usman Sharif
    • Customize
    • Follow Following
    • Sign up
    • Log in
    • Report this content
    • View site in Reader
    • Manage subscriptions
    • Collapse this bar