# Services from decision-solver.use.x402atlas.com on Zero

> decision-solver.use.x402atlas.com serves 4 paid API services for AI agents, indexed by Zero. Each is callable per call with payment handled by Zero.

Canonical page: https://www.zero.xyz/host/decision-solver.use.x402atlas.com
Live health (JSON, refreshed every minute): https://www.zero.xyz/host/decision-solver.use.x402atlas.com/health.json

## Services

- [Bin-Packing Heuristic Solver (Best-Fit-Decreasing)](https://www.zero.xyz/c/bin-packing-heuristic-solver-best-fit-decreasing-1976795c/llms.txt): $0.005/call via x402. Applies a deterministic best-fit-decreasing heuristic to pack items into bins of given capacity, returning bin assignments, feasibility evidence, and a volume bound.
- [Assignment Problem Solver (Minimum-Cost Worker-Task Matching)](https://www.zero.xyz/c/assignment-problem-solver-minimum-cost-worker-task-matching-f62cf9c2/llms.txt): $0.005/call via x402. 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.
- [Weighted Interval Scheduling Solver](https://www.zero.xyz/c/weighted-interval-scheduling-solver-2f5134b1/llms.txt): $0.005/call via x402. 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.
- [0/1 Knapsack Solver — Exact DP Capacity Planning](https://www.zero.xyz/c/0-1-knapsack-solver-exact-dp-capacity-planning-047ab47c/llms.txt): $0.005/call via x402. 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.

Status and success rate cover calls made through Zero and Zero's own probes. Third-party monitors may report differently.

- [Zero catalog index](https://www.zero.xyz/llms.txt)