CoopPostman: Optimal Routing and Cost Allocation for the Chinese Postman Game

Solves the Chinese Postman Problem (CPP) using Dijkstra's algorithm for shortest paths, Edmonds' Blossom algorithm (1965) for minimum weight perfect matching, and Fleury's algorithm for Eulerian circuit generation. Additionally, computes the cooperative gamma-rule cost allocation proposed by Hamers, Klijn, Suijs, and Tijs (1999) <doi :10.1016/S0377-2217(98)00346-6> for weakly Eulerian networks.

Version:	0.1.0
Imports:	igraph, graphics
Suggests:	ggplot2
Published:	2026-10-15
DOI:	10.32614/CRAN.package.CoopPostman (may not be active yet)
Author:	Maria Gabriela Perez [aut, cre]
Maintainer:	Maria Gabriela Perez <maria.g.perezs at udc.es>
License:	GPL (≥ 3)
NeedsCompilation:	no
CRAN checks:	CoopPostman results

Documentation:

Reference manual:

CoopPostman.html , CoopPostman.pdf

Downloads:

Package source:	CoopPostman_0.1.0.tar.gz
Windows binaries:	r-devel: not available, r-release: not available, r-oldrel: not available
macOS binaries:	r-release (arm64): CoopPostman_0.1.0.tgz, r-oldrel (arm64): CoopPostman_0.1.0.tgz, r-release (x86_64): CoopPostman_0.1.0.tgz, r-oldrel (x86_64): CoopPostman_0.1.0.tgz

Linking:

Please use the canonical form https://CRAN.R-project.org/package=CoopPostman to link to this page.