0/1 knapsack solver — exact work-bounded capacity planning and portfolio selection for…
0/1 knapsack solver — exact work-bounded capacity planning and portfolio selection for maximum value, with deterministic ties and reproducible DP evidence.
4 resources listed under decision-solver.use.x402atlas.com.
Source: https://api.cdp.coinbase.com/platform/v2/x402/discovery/resources · last updated 2026-10-14
These 4 resources were mirrored from Coinbase's public Bazaar. Claim them all at once by submitting your own manifest — no account required, and it always overrides the mirrored copy.
Claim this provider0/1 knapsack solver — exact work-bounded capacity planning and portfolio selection for maximum value, with deterministic ties and reproducible DP evidence.
Weighted interval scheduling solver — exact maximum-weight compatible job scheduling with half-open intervals and a complete dynamic-programming certificate.
Bin-packing heuristic — deterministic best-fit-decreasing capacity planning for placing items into bins, with feasibility evidence and an honest volume bound.
Assignment solver — exact minimum-cost worker-to-task matching for resource allocation, with deterministic choices and a primal/dual optimality certificate.
All resources from this provider: /discovery/merchant (by payment address) or filter /discovery/resources.