New primal and dual matching heuristics
type: Item
instance of: scholarly article
title: New primal and dual matching heuristics
zbMATH Open document ID: 0827.68047
DOI: 10.1007/BF01293485
author: Michael Jünger
author: William R. Pulleyblank
published in: Algorithmica
publication date: 1995-05-30T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 759300
zbMATH Keywords: heuristic
zbMATH Keywords: minimum-cost spanning tree
zbMATH Keywords: moat widths
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q3716294
cites work: A survey of heuristics for the weighted matching problem
cites work: Q5729634
cites work: Tight bounds for christofides' traveling salesman heuristic
cites work: Q4197644
cites work: Solving large-scale matching problems efficiently: A new primal matching approach
cites work: Paths, Trees, and Flowers
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Q4763416
cites work: A lower bound to the complexity of Euclidean and rectilinear matching algorithms
cites work: A new class of heuristic algorithms for weighted perfect matching
cites work: Solving matching problems with linear programming
cites work: Optimal control of plotting and drilling machines: A case study
cites work: Heuristics for planar minimum‐weight perfect metchings
cites work: Q4036709
cites work: Computing correct Delaunay triangulations
cites work: Q3219753
cites work: IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
cites work: On a Greedy Heuristic for Complete Matching
cites work: Q4133127
cites work: Q3707420
cites work: Euclidean matching problems and the metropolis algorithm
full work available at URL: https://doi.org/10.1007/bf01293485
OpenAlex ID: W2077074857
description: scientific article; zbMATH DE number 759300