Module assignment 

Certified minimum-cost bipartite assignment.

The unrestricted solver is a polynomial min-cost-flow reduction. The no-crossing policy uses a polynomial sequence-alignment dynamic program, because pairwise voice-order constraints are not ordinary edge costs. Both paths return independently checkable optimality certificates.

Structs

Assignment

A complete minimum-cost assignment and its optimality certificate.

AssignmentPolicy

Costs and structural rules for one assignment.

CostMatrix

Dense row-major costs between source and target items.

Enums

AssignmentCertificate

Optimality witness for one of the two assignment solvers.

AssignmentOperation

One edit or correspondence in a complete bipartite assignment.

DoublingPolicy

Whether one source may supply multiple targets.

VoiceCrossingPolicy

Policy for assignments that reverse the order of two source voices.

Traits

AssignmentCost

Additive, ordered cost used by certified assignment.

Functions

min_cost_assignment

Finds a minimum-cost assignment under insertion, deletion, doubling, and voice-crossing rules.

min_cost_assignment_with_control

Finds a minimum-cost assignment under explicit work and cancellation control.

verify_assignment

Verifies assignment feasibility, exact cost, and the supplied optimality certificate.