4 Services from decision-solver.use.x402atlas.com

Applies a deterministic best-fit-decreasing heuristic to pack items into bins of given capacity, returning bin assignments, feasibility evidence, and a volume bound.

Solves the linear assignment problem to find the exact minimum-cost one-to-one matching between workers and tasks, returning a primal/dual optimality certificate.

Solves the exact maximum-weight compatible job scheduling problem over half-open intervals using dynamic programming, returning an optimal selection with a full DP certificate.

Solves the 0/1 knapsack problem exactly using dynamic programming, selecting items to maximize total value within a weight/capacity constraint with deterministic tie-breaking and reproducible evidence.