Branch and bound for tsp demo

版本 1.2.0.0 (16.2 KB) 作者: Martin
The different algorithms for branch and bound are executed in a GUI with explanations.
5.0
(4)
2.0K 次下载
更新时间 2012/1/21

查看许可证

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!

引用格式

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. 检索来源 .

MATLAB 版本兼容性
创建方式 R2011a
兼容任何版本
平台兼容性
Windows macOS Linux
类别
在 Help Center 和 MATLAB Answers 中查找有关 Traveling Salesman (TSP) 的更多信息

Community Treasure Hunt

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

Start Hunting!

版本 已发布 发行说明
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