Combinatorica`
Combinatorica`

TravelingSalesmanBounds

バージョン10で，Combinatorica パッケージの機能のほとんどがWolframシステムに組み込まれた． »

TravelingSalesmanBounds[g]

グラフ g における最小コストの巡回セールスマンの経路に対する上限と下限を与える．

詳細とオプション

  • TravelingSalesmanBoundsを使うためには，まず Combinatorica パッケージをロードしなくてはならない．それには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 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

BibTeX

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

BibLaTeX

@online{reference.wolfram_2024_travelingsalesmanbounds, organization={Wolfram Research}, title={TravelingSalesmanBounds}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/TravelingSalesmanBounds.html}, note=[Accessed: 18-November-2024 ]}