Bounded Decision Solver

Endpoints (8 live)

• POST /bin-pack — Bin-packing heuristic — deterministic best-fit-decreasing capacity planning for placing items into bins, with feasibility evidence and an honest volume bound. (0.005 USDC on Base)
• POST /assignment — Assignment solver — exact minimum-cost worker-to-task matching for resource allocation, with deterministic choices and a primal/dual optimality certificate. (0.005 USDC on Base)
• POST /interval-schedule — Weighted interval scheduling solver — exact maximum-weight compatible job scheduling with half-open intervals and a complete dynamic-programming certificate. (0.005 USDC on Base)
• POST /knapsack — 0/1 knapsack solver — exact work-bounded capacity planning and portfolio selection for maximum value, with deterministic ties and reproducible DP evidence. (0.005 USDC on Solana)
• GET /knapsack (free)
• GET /bin-pack (free)
• GET /interval-schedule (free)
• GET /assignment (free)