Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems (Q3346092): Difference between revisions

@@ 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.1080/01966324.1984.10737137
+Normal rank
@@ Property / OpenAlex ID @@
+W2091820560
@@ Property / OpenAlex ID: W2091820560 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58249322
@@ Property / Wikidata QID: Q58249322 / rank @@
+Normal rank
@@ Property / cites work @@
+A versatile scheme for ranking the extreme points of an assignment polytope
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem: A Survey
@@ Property / cites work: The Traveling Salesman Problem: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Traveling Salesman Problem
@@ Property / cites work: An Algorithm for the Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of solving the assignment problem for the traveling salesman problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3346092