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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking arborescences in O(Km log n) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thek best spanning arborescences of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(K\)th best base of a matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Algorithms for Generating Weighted Spanning Trees in Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding the K best cuts in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacency of the best and second best valued solutions in combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding <i>K</i> Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions of the kth best route through a network. A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized dynamic programming methods in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem / rank
 
Normal rank

Revision as of 09:07, 17 July 2024

scientific article; zbMATH DE number 6979567
Language Label Description Also known as
English
The Kth TSP is pseudopolynomial when TSP is polynomial
scientific article; zbMATH DE number 6979567

    Statements

    The Kth TSP is pseudopolynomial when TSP is polynomial (English)
    0 references
    0 references
    14 November 2018
    0 references
    \(K\) best solutions
    0 references
    traveling salesman problem
    0 references
    \(K\)th best traveling salesman problem
    0 references
    pseudopolynomial
    0 references

    Identifiers