TravelingSalesmanBounds
TravelingSalesmanBounds[g]
gives upper and lower bounds on a minimum-cost traveling salesman tour of graph 
.
Combinatorica`
Combinatorica`
TravelingSalesmanBounds
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
TravelingSalesmanBounds[g]
gives upper and lower bounds on a minimum-cost traveling salesman tour of graph 
.
更多信息和选项
- To use TravelingSalesmanBounds, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Wolfram Research (2012)，TravelingSalesmanBounds，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesmanBounds.html.
文本
Wolfram Research (2012)，TravelingSalesmanBounds，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesmanBounds.html.
CMS
Wolfram 语言. 2012. "TravelingSalesmanBounds." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesmanBounds.html.
APA
Wolfram 语言. (2012). TravelingSalesmanBounds. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesmanBounds.html 年