The `linear-sum-assignment` package provides a JavaScript implementation of the Jonker‑Volgenant algorithm that solves rectangular linear‑sum assignment problems—assigning every row to a column when rows ≤ columns (or vice‑versa) to minimize the total cost. It is aimed at developers working with data‑analysis, machine‑learning, or scientific computing tasks that require optimal matching between uneven sets of items.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of mljs/linear-sum-assignment
Types for cheminfo packages and cheminfo data schema
Matrix manipulation and computation library
Various method to process spectra
TypeScript definitions for node
V8 coverage provider for Vitest
Shared TypeScript configurations for projects that Zakodium maintains.
Shared ESLint config for TypeScript projects
Extend jest to assert arrays with approximate values
A deep deletion module for node (like `rm -rf`)
TypeScript is a language for application scale JavaScript development
Next generation testing framework powered by Vite
Support the repos that depend on this repository
Top contributors
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet