New primal and dual matching heuristics (Q1891231): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q582214
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: William R. Pulleyblank / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3716294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of heuristics for the weighted matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for christofides' traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large-scale matching problems efficiently: A new primal matching approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound to the complexity of Euclidean and rectilinear matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of heuristic algorithms for weighted perfect matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving matching problems with linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control of plotting and drilling machines: A case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for planar minimum‐weight perfect metchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing correct Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Greedy Heuristic for Complete Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean matching problems and the metropolis algorithm / rank
 
Normal rank

Revision as of 14:40, 23 May 2024

scientific article
Language Label Description Also known as
English
New primal and dual matching heuristics
scientific article

    Statements

    New primal and dual matching heuristics (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 May 1995
    0 references
    0 references
    heuristic
    0 references
    minimum-cost spanning tree
    0 references
    moat widths
    0 references