知识卡片
旅行商问题的两种形式
- 旅行商优化问题在带非负整数费用的完全图上,寻找经过每城一次并回到起点的最低费用环;
- 判定问题给出预算k,问是否存在费用不超过k的环。
费用最小值和是否低于阈值是不同的输出。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第34章 NP完全性 · 查看原书依据
In the traveling-salesperson problem, which is closely related to the hamiltonian-cycle problem, a salesperson must visit n cities. Let’s model the problem as a complete graph with n vertices, so that the salesperson wishes to make a tour, or hamiltonian cycle, visiting each city exactly once and finishing at the starting city. The salesperson
参考来源
- 位置:《算法导论(第4版)》第34章《NP完全性》(OEBPS/chapter034.xhtml,文本字符[105000,110000))。
- 结论依据:第34章原文中的定义、规模界及双向归约证明;涉及图34.17–34.19时已核对图像。
- 原始内容:In the traveling-salesperson problem , which is closely related to the hamiltonian-cycle problem, a salesperson must visit n cities. Let’s model the problem as a complete graph with n vertices, so that the salesperson wishes to make a tour , or hamiltonian cycle, visiting each city exactly once and finishing at the starting city. The salesperson