Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (Q5111717): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Improving TSP Tours Using Dynamic Programming over Tree Decompositions. | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2604874681 / rank | |||
Normal rank | |||
| Property / title | |||
Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (English) | |||
| Property / title: Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (English) / rank | |||
Normal rank | |||
Latest revision as of 10:07, 30 July 2024
scientific article; zbMATH DE number 7205008
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving TSP Tours Using Dynamic Programming over Tree Decompositions. |
scientific article; zbMATH DE number 7205008 |
Statements
27 May 2020
0 references
TSP
0 references
treewidth
0 references
local search
0 references
XP algorithm
0 references
hardness in P
0 references
0 references
0 references
0 references
Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (English)
0 references
