Branch and bound for tsp demo

Version 1.2.0.0 (16.2 KB) by Martin
The different algorithms for branch and bound are executed in a GUI with explanations.
5.0
(4)
2K Downloads
Updated 21 Jan 2012

View License

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!

Cite As

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. Retrieved .

MATLAB Release Compatibility
Created with R2011a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Traveling Salesman (TSP) in Help Center and MATLAB Answers

Community Treasure Hunt

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

Start Hunting!

Version Published Release Notes
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