Branch and bound for tsp demo

Version 1.2.0.0 (16,2 ko) par Martin
The different algorithms for branch and bound are executed in a GUI with explanations.
5.0
(4)
2K téléchargements
Mise à jour 21 jan. 2012

Afficher la licence

This demonstration shows the single steps of nearest neighbour, hungarian method (munkres algorithm) for assignment problem, branch and bound for symmetric or asymmetric cost matrices. The tree of the branch and bound algorithm is shown and the user can select more or less details. With the file 4 examples are provided, own examples can be entered, too.NOTE: This program is not suitable for matrices larger than 9x9!

Citation pour cette source

Martin (2024). Branch and bound for tsp demo (https://www.mathworks.com/matlabcentral/fileexchange/34630-branch-and-bound-for-tsp-demo), MATLAB Central File Exchange. Récupéré le .

Compatibilité avec les versions de MATLAB
Créé avec R2011a
Compatible avec toutes les versions
Plateformes compatibles
Windows macOS Linux
Catégories
En savoir plus sur Traveling Salesman (TSP) dans Help Center et MATLAB Answers

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Version Publié le Notes de version
1.2.0.0

Bugfix

1.1.0.0

there was a bug in the nearest neighbour algorithm for asymmetric cost matrices
1.0.0.0