Implement Travelling salesman problem solution using DP with bit-mask

metoop / Dynamic-programming

MIT License

2 stars 7 forks source link

Implement Travelling salesman problem solution using DP with bit-mask #1

Closed pradeexsu closed 4 years ago

pradeexsu commented 4 years ago

the travelling salesman problem asks the following question:

 "Given a list of cities and the distances between each pair of cities, 
what is the shortest possible route that visits each city exactly once and 
returns to the origin city?"

wiki

Note: Read README carefully.

himanisuthar commented 4 years ago

@sutharp777 i want to work on this issue