Crandore Hub

muRty

Murty's Algorithm for k-Best Assignments

Calculates k-best solutions and costs for an assignment problem following the method outlined in Murty (1968) <doi:10.1287/opre.16.3.682>.

Versions across snapshots

VersionRepositoryFileSize
0.3.1 rolling linux/jammy R-4.5 muRty_0.3.1.tar.gz 47.7 KiB
0.3.1 rolling linux/noble R-4.5 muRty_0.3.1.tar.gz 47.6 KiB
0.3.1 rolling source/ R- muRty_0.3.1.tar.gz 15.8 KiB
0.3.1 latest linux/jammy R-4.5 muRty_0.3.1.tar.gz 47.7 KiB
0.3.1 latest linux/noble R-4.5 muRty_0.3.1.tar.gz 47.6 KiB
0.3.1 latest source/ R- muRty_0.3.1.tar.gz 15.8 KiB
0.3.1 2026-04-26 source/ R- muRty_0.3.1.tar.gz 15.8 KiB
0.3.1 2026-04-23 source/ R- muRty_0.3.1.tar.gz 15.8 KiB
0.3.1 2026-04-09 windows/windows R-4.5 muRty_0.3.1.zip 50.0 KiB
0.3.1 2025-04-20 source/ R- muRty_0.3.1.tar.gz 15.8 KiB

Dependencies (latest)

Imports

Suggests