Worst-case analysis of a new heuristic for the travelling salesman problem (Q2120141): Difference between revisions

@@ Property / DOI @@
-.1007/s43069-021-00101-z
@@ Property / DOI: 10.1007/s43069-021-00101-z / 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.1007/s43069-021-00101-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2117226423
@@ Property / OpenAlex ID: W2117226423 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4083324
@@ Property / cites work: Q4083324 / rank @@
+Normal rank
@@ Property / cites work @@
+The Shortest Hamiltonian Chain of a Graph
@@ Property / cites work: The Shortest Hamiltonian Chain of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+The Loading Problem
@@ Property / cites work: The Loading Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Near-Optimal Graph Coloring
@@ Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / DOI @@
+.1007/S43069-021-00101-Z
@@ Property / DOI: 10.1007/S43069-021-00101-Z / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2120141