Assignment Problem with Maximum Weight via Bitmask DP
Filed under CodeNation
The question
Given an N x N cost matrix for assigning N items to N individuals, find the assignment that maximizes total weight such that each person receives exactly one item.
No write-up yet. Related questions below have one.
Related CodeNation questions
Collected from public candidate posts and coding forums. Updated Nov 2026.