{"name":"Bounded Decision Solver","mount":"/decision-solver","host":"decision-solver.use.x402atlas.com","base_url":"https://decision-solver.use.x402atlas.com","service_name":"x402 Atlas tools","x402_enabled":true,"endpoints":[{"method":"POST","path":"/assignment","url":"https://decision-solver.use.x402atlas.com/assignment","example_request":{"url":"https://decision-solver.use.x402atlas.com/assignment","body":{"costs":[[4,1,3],[2,0,5],[3,2,2]]},"content_type":"application/json"},"description":"Assignment solver — exact minimum-cost worker-to-task matching for resource allocation, with deterministic choices and a primal/dual optimality certificate.","paid":true,"price":"$0.005","discoverable":true},{"method":"POST","path":"/bin-pack","url":"https://decision-solver.use.x402atlas.com/bin-pack","example_request":{"url":"https://decision-solver.use.x402atlas.com/bin-pack","body":{"capacity":10,"items":[{"id":"a","size":8},{"id":"b","size":7},{"id":"c","size":6},{"id":"d","size":5},{"id":"e","size":4}]},"content_type":"application/json"},"description":"Bin-packing heuristic — deterministic best-fit-decreasing capacity planning for placing items into bins, with feasibility evidence and an honest volume bound.","paid":true,"price":"$0.005","discoverable":true},{"method":"POST","path":"/interval-schedule","url":"https://decision-solver.use.x402atlas.com/interval-schedule","example_request":{"url":"https://decision-solver.use.x402atlas.com/interval-schedule","body":{"intervals":[{"id":"a","start":0,"end":3,"weight":5},{"id":"b","start":1,"end":4,"weight":6},{"id":"c","start":3,"end":5,"weight":5}]},"content_type":"application/json"},"description":"Weighted interval scheduling solver — exact maximum-weight compatible job scheduling with half-open intervals and a complete dynamic-programming certificate.","paid":true,"price":"$0.005","discoverable":true},{"method":"POST","path":"/knapsack","url":"https://decision-solver.use.x402atlas.com/knapsack","example_request":{"url":"https://decision-solver.use.x402atlas.com/knapsack","body":{"capacity":7,"items":[{"id":"camera","weight":3,"value":4},{"id":"battery","weight":4,"value":5},{"id":"tripod","weight":5,"value":6}]},"content_type":"application/json"},"description":"0/1 knapsack solver — exact work-bounded capacity planning and portfolio selection for maximum value, with deterministic ties and reproducible DP evidence.","paid":true,"price":"$0.005","discoverable":true}]}