https://github.com/lucasbotang/coursera_discrete_optimization

combinational-optimization heuristic knapsack meta-heuristic np-complete python tsp vrp

Last synced: 6 months ago
JSON representation

Exact and meta-heuristic algorithms for NP problems

Host: GitHub
URL: https://github.com/lucasbotang/coursera_discrete_optimization
Owner: LucasBoTang
License: mit
Created: 2018-05-17T23:56:03.000Z (over 7 years ago)
Default Branch: master
Last Pushed: 2019-10-28T02:10:39.000Z (almost 6 years ago)
Last Synced: 2025-04-12T05:38:05.935Z (6 months ago)
Topics: combinational-optimization, heuristic, knapsack, meta-heuristic, np-complete, python, tsp, vrp
Language: Python
Homepage:
Size: 11.3 MB
Stars: 20
Watchers: 1
Forks: 3
Open Issues: 0
Metadata Files:
- Readme: README.md
- License: LICENSE

README

# Discrete Optimization Solver

## 01 Knapsack Problem

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

## 04 Facility Location Problem

Method:
- Branch and Bound
- Tabu Search
- Visualization

## 05 Vehicle Routing Problem

Method:
- Genetic Algorithm
- 2 Opt
- Variable Neighborhood Search
- Visualization