Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
type: Item
instance of: scholarly article
title: Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
zbMATH Open document ID: 1391.90622
author: Sanne Wøhlk
author: G. Laporte
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
full work available at URL: W hlk2017 Computational Comparison of Several Greedy Algorithms AM.pdf
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901478
zbMATH Keywords: perfect matching problem
zbMATH Keywords: blossom algorithm
zbMATH Keywords: capacitated arc routing problem
zbMATH Keywords: rural postman problem
zbMATH Keywords: garbage collection
describes a project that uses: CPLEX
describes a project that uses: Blossom V
describes a project that uses: Blossom IV
MaRDI profile type: Publication
OpenAlex ID: W2622841700
cites work: Q5729634
cites work: Computing Minimum-Weight Perfect Matchings
cites work: Paths, Trees, and Flowers
cites work: Approximation Algorithms for Some Postman Problems
cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem
cites work: Blossom V: A new implementation of a minimum cost perfect matching algorithm
cites work: Tour splitting algorithms for vehicle routing problems
cites work: Fast and Simple Algorithms for Weighted Perfect Matching
cites work: An Approximation Algorithm for the Capacitated Arc Routing Problem
DOI: 10.1016/J.COR.2017.06.006
description: scientific article; zbMATH DE number 6901478