# Bin-Packing Heuristic Solver (Best-Fit-Decreasing)

> Bin-Packing Heuristic Solver (Best-Fit-Decreasing) is a paid API for AI agents from decision-solver.use.x402atlas.com, paid per call via x402, $0.005/call, status unknown (last checked 2026-09-14).

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

## Facts

- Endpoint: POST https://decision-solver.use.x402atlas.com/bin-pack
- Price: $0.005/call
- Payment: x402
- Status: unknown
- Last checked: 2026-09-14
- Activations on Zero: 0
- Tags: x402
- Canonical page: https://www.zero.xyz/c/bin-packing-heuristic-solver-best-fit-decreasing-1976795c
- Structured record (JSON): https://api.zero.xyz/v1/capabilities/cap_lDt1QR4OcJ4gCrB8EkR8Z

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

## How to call it through Zero

Zero handles the 402 payment challenge and records the run. With the Zero CLI installed (`npm i -g @zeroxyz/cli`):

```sh
zero fetch --capability bin-packing-heuristic-solver-best-fit-decreasing-1976795c -d '<json body>'
```

Example prompt: I need to pack 12 items with sizes [4, 8, 1, 4, 2, 1, 5, 3, 7, 2, 6, 4] into bins that each hold a capacity of 10 — can you run a best-fit-decreasing bin packing and tell me how many bins are needed and how items are assigned?

## When to prefer this

Choose this endpoint when you need a fast, deterministic bin-packing solution backed by a provable volume bound and feasibility certificate. It is ideal for capacity planning where exact optimality is not required but reproducibility and a quality guarantee matter. Prefer over exact solvers (like the sibling 0/1 knapsack endpoint) when items are divisible-style capacity problems and speed matters more than absolute optimality.

## Known failure modes

- Items with size exceeding bin capacity cannot be packed — returns infeasibility evidence
- Empty items array returns trivially zero bins
- Malformed item sizes or negative values may return a validation error
- Very large item counts may hit computation time limits

## How this service works

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

## Output

Returns a bin-packing plan including which items are assigned to which bin, the total number of bins used, a feasibility indicator confirming whether all items were placed, and an honest volume bound showing how close the solution is to optimal.

## More

- Live health (JSON, refreshed every minute): https://www.zero.xyz/c/bin-packing-heuristic-solver-best-fit-decreasing-1976795c/health.json
- [Zero catalog index](https://www.zero.xyz/llms.txt)
- [Other services from decision-solver.use.x402atlas.com](https://www.zero.xyz/host/decision-solver.use.x402atlas.com/llms.txt)