The Kth TSP is pseudopolynomial when TSP is polynomial (Q4554540): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133397
@@ Property / cites work: Q4133397 / rank @@
+Normal rank
@@ Property / cites work @@
+Ranking arborescences in O(Km log n) time
@@ Property / cites work: Ranking arborescences in O(Km log n) time / rank @@
+Normal rank
@@ Property / cites work @@
+Thek best spanning arborescences of a network
@@ Property / cites work: Thek best spanning arborescences of a network / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(K\)th best base of a matroid
@@ Property / cites work: On the \(K\)th best base of a matroid / rank @@
+Normal rank
@@ Property / cites work @@
+Q3005918
@@ Property / cites work: Q3005918 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3996742
@@ Property / cites work: Q3996742 / rank @@
+Normal rank
@@ Property / cites work @@
+Two Algorithms for Generating Weighted Spanning Trees in Order
+Normal rank
@@ Property / cites work @@
+On finding the K best cuts in a network
@@ Property / cites work: On finding the K best cuts in a network / rank @@
+Normal rank
@@ Property / cites work @@
+Adjacency of the best and second best valued solutions in combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+An Algorithm for Finding <i>K</i> Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems
+Normal rank
@@ Property / cites work @@
+Solving the Fixed Charge Problem by Ranking the Extreme Points
+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 @@
+Solutions of the kth best route through a network. A review
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized dynamic programming methods in integer programming
+Normal rank
@@ Property / cites work @@
+An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s1793830918500581
+Normal rank
@@ Property / OpenAlex ID @@
+W2810038234
@@ Property / OpenAlex ID: W2810038234 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q129649471
@@ Property / Wikidata QID: Q129649471 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4554540