The traveling salesman problem with few inner points (Q2583717): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2005.01.002
@@ Property / DOI: 10.1016/j.orl.2005.01.002 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2005.01.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2111090561
@@ Property / OpenAlex ID: W2111090561 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+The prize collecting traveling salesman problem
@@ Property / cites work: The prize collecting traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming Treatment of the Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+The Convex-hull-and-k-line Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem
@@ Property / cites work: The Traveling-Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4155835
@@ Property / cites work: Q4155835 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized and Exact Computation
@@ Property / cites work: Parameterized and Exact Computation / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Parameterized and Exact Computation
@@ Property / cites work: Parameterized and Exact Computation / rank @@
+Normal rank
@@ Property / cites work @@
+The searching over separators strategy to solve some NP-hard problems in subexponential time
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems
+Normal rank
@@ Property / cites work @@
+The Euclidean traveling salesman problem is NP-complete
+Normal rank
@@ Property / cites work @@
+Q4542574
@@ Property / cites work: Q4542574 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133641
@@ Property / cites work: Q4133641 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414647
@@ Property / cites work: Q4414647 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2005.01.002
@@ Property / DOI: 10.1016/J.ORL.2005.01.002 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2583717