A bound for the symmetric travelling salesman problem through matroid formulation (Q1388823): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Two algorithms for weighted matroid intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection of Two Matroids: (Condensed) Border Graphs and Ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Matroid Partition and Intersection Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted matroid intersection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Additive Bounding Procedure for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank

Latest revision as of 12:55, 28 May 2024

scientific article
Language Label Description Also known as
English
A bound for the symmetric travelling salesman problem through matroid formulation
scientific article

    Statements

    A bound for the symmetric travelling salesman problem through matroid formulation (English)
    0 references
    0 references
    0 references
    27 January 1999
    0 references
    0 references
    bound
    0 references
    symmetric traveling salesman
    0 references
    matroid
    0 references