Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3701213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight two-connected spanning networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing the Held-Karp TSP bound: A monotonicity property with application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic analysis, linear programming and branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Exact Integrality Gap for Small Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Integrality Ratio for the Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case comparison of valid inequalities for the TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2999650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for the ratio between the 2-matching problem and its linear programming relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3439689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not Every GTSP Facet Induces an STSP Facet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem on a graph and some related integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices / rank
 
Normal rank

Latest revision as of 02:04, 5 July 2024

scientific article
Language Label Description Also known as
English
Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
scientific article

    Statements

    Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (English)
    0 references
    0 references
    0 references
    5 April 2012
    0 references
    traveling salesman problem
    0 references
    2-matching
    0 references
    approximation algorithm
    0 references

    Identifiers