View Code? Open in Web Editor
NEW
Exact and meta-heuristic algorithms for NP problems
License: MIT License
coursera_discrete_optimization's Introduction
Discrete Optimization Solver
Method:
- Dynamic Programming
- Branch and Bound
- Greedy Heuristic
02 Graph Coloring Problem
Method:
- Depth First Search
- Constraint Programming
03 Traveling Salesman Problem
Method:
- Simulated Annealing
- K Opt
- Visualization
![](03Traveling_Salesman/TSP.jpg)
04 Facility Location Problem
Method:
- Branch and Bound
- Tabu Search
- Visualization
![](04Facility_Location/Facility_Location.jpg)
05 Vehicle Routing Problem
Method:
- Genetic Algorithm
- 2 Opt
- Variable Neighborhood Search
- Visualization
![](05Vehicle_Routing/VRP.jpg)
coursera_discrete_optimization's People
Contributors
Watchers