Matroid-based TSP rounding for half-integral solutions (Q2164710): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Worst-case analysis of a new heuristic for the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5075801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Distribution of the Number of Successes in Independent Trials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for TSP in the half integral case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Rounding Approach to the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931037 / 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

Latest revision as of 22:21, 29 July 2024

scientific article
Language Label Description Also known as
English
Matroid-based TSP rounding for half-integral solutions
scientific article

    Statements

    Matroid-based TSP rounding for half-integral solutions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 August 2022
    0 references
    0 references
    half-integral solution
    0 references
    subtour-elimination relaxation
    0 references
    matroid intersection polytope
    0 references
    0 references
    0 references