Skip to content

Implementation of a MILP with Dantzig's and the MTZ subtour elimination constraints. Dantzig's constraints are added recursively. Scripts also contain a few heuristics for the TSP.

Notifications You must be signed in to change notification settings

guilhermecadori/ExactMethodsAndHeuristics_TravelingSalesMan

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

21 Commits
 
 
 
 

Repository files navigation

Exact methods and heuristics for the Traveling Salesman Problem

Implementation of a MILP with Dantzig's and the MTZ subtour elimination constraints. Dantzig's constraints are added recursively. Scripts also contain a few heuristics for the TSP.

About

Implementation of a MILP with Dantzig's and the MTZ subtour elimination constraints. Dantzig's constraints are added recursively. Scripts also contain a few heuristics for the TSP.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published