Assignment solver — exact minimum-cost worker-to-task matching for resource allocation, with deterministic choices and a primal/dual optimality certificate.

Bin-packing heuristic — deterministic best-fit-decreasing capacity planning for placing items into bins, with feasibility evidence and an honest volume bound.

Weighted interval scheduling solver — exact maximum-weight compatible job scheduling with half-open intervals and a complete dynamic-programming certificate.

0/1 knapsack solver — exact work-bounded capacity planning and portfolio selection for maximum value, with deterministic ties and reproducible DP evidence.