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

Details

Wolfram Research (2012), TravelingSalesmanBounds, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesmanBounds.html.

Text

Wolfram Research (2012), TravelingSalesmanBounds, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesmanBounds.html.

BibTeX

@misc{reference.wolfram_2021_travelingsalesmanbounds, author="Wolfram Research", title="{TravelingSalesmanBounds}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesmanBounds.html}", note=[Accessed: 26-September-2021 ]}

BibLaTeX

@online{reference.wolfram_2021_travelingsalesmanbounds, organization={Wolfram Research}, title={TravelingSalesmanBounds}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesmanBounds.html}, note=[Accessed: 26-September-2021 ]}

CMS

Wolfram Language. 2012. "TravelingSalesmanBounds." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesmanBounds.html.

APA

Wolfram Language. (2012). TravelingSalesmanBounds. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesmanBounds.html