A survey of heuristics for the weighted matching problem (Q3315292): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3767380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximation Methods for the Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5568974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subadditive Euclidean functionals and nonlinear growth in geometric probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching / rank
 
Normal rank

Latest revision as of 11:57, 14 June 2024

scientific article
Language Label Description Also known as
English
A survey of heuristics for the weighted matching problem
scientific article

    Statements

    A survey of heuristics for the weighted matching problem (English)
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    exact algorithms
    0 references
    survey
    0 references
    heuristics
    0 references
    weighted matching problems
    0 references
    assignment problem
    0 references
    worst-case ratio bounds
    0 references
    absolute bounds
    0 references
    expected bounds
    0 references
    0 references