Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
Sanne Wøhlk, Gilbert Laporte
| Year of publication: |
November 2017
|
|---|---|
| Authors: | Wøhlk, Sanne ; Laporte, Gilbert |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 87.2017, p. 107-113
|
| Subject: | Perfect matching problem | Blossom algorithm | Capacitated arc routing problem | Rural postman problem | Garbage collection | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Graphentheorie | Graph theory | Matching | Mathematische Optimierung | Mathematical programming |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2017.06.006 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011743411