{"uid":"cap_lDt1QR4OcJ4gCrB8EkR8Z","slug":"bin-packing-heuristic-solver-best-fit-decreasing-1976795c","name":"Bin-Packing Heuristic Solver (Best-Fit-Decreasing)","description":"Bin-packing heuristic — deterministic best-fit-decreasing capacity planning for placing items into bins, with feasibility evidence and an honest volume bound.","url":"https://decision-solver.use.x402atlas.com/bin-pack","method":"POST","headers":{},"bodySchema":null,"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.005","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"registry","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.005/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.005","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.005","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_5NDlKTjvi63TUWiwuWwdV","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.005","costPer":"request","priority":0,"asset":null,"unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Applies a deterministic best-fit-decreasing heuristic to pack items into bins of given capacity, returning bin assignments, feasibility evidence, and a volume bound.","exampleAgentPrompt":"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?","exampleUseCases":[{"title":"Truck loading capacity planning","prompt":"I have 20 pallets with weights [120, 85, 200, 60, 175, 90, 140, 55, 210, 95, 130, 70, 160, 45, 185, 100, 75, 150, 115, 80] kg and each truck holds 500 kg — use best-fit-decreasing bin packing to tell me how many trucks I need and which pallets go on each truck."},{"title":"Cloud VM workload placement","prompt":"I need to place 15 microservices with memory requirements [512, 256, 1024, 768, 128, 512, 384, 256, 1024, 512, 256, 768, 128, 384, 512] MB onto VMs that each have 2048 MB of RAM — run a bin-packing heuristic and show me which services fit on which VM."},{"title":"Warehouse bin storage assignment","prompt":"We have 10 order batches with volumes [3.2, 1.5, 4.8, 2.1, 3.7, 0.9, 4.2, 1.8, 3.0, 2.5] cubic feet and our storage bins each hold 6 cubic feet — can you do a best-fit-decreasing pack and tell me how many bins we need and whether the assignment is feasible?"}],"resultDescription":"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.","failureModes":["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"],"whenToPreferThis":"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.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T06:30:32.019Z","isFirstParty":false}