Make your next step
a little clearer.

Service Radius Center Plan Reconciliation

Choose permitted service centers to reduce the worst supplied distance and reconcile a recorded plan with complete finite-set witnesses.

Choose permitted service centers to reduce the worst supplied distance and reconcile a recorded plan with complete finite-set witnesses. Exactly p distinct centers among at most twelve candidates and twenty-four demand points; one to six centers and two independent records. Enumerate every p-subset, at most 924, and minimize the maximum demand-to-nearest-selected-center distance. Nonnegative integer matrix entries up to one million use supplied consistent units; no symmetry, triangle inequality or geography is assumed. Equal objectives use lexicographically earliest supplied index tuple; assignments use earliest selected index on ties. Every subset carries a demand that prevents any strictly smaller radius, and all optimum ties are counted. No capacities, opening/shipping sum costs, center-to-center separation, road lookup or live dispatch. All matrix, reference and subset bounds are checked before checkout. Private JSON report, retained for 30 days. One-time USD 9.00 job. Uses only supplied records; no external system changes. Exact within the stated finite model, with no inferred demand, travel data or operational guarantee. Integral report quantities must remain exactly representable; unsupported calculation profiles reject before checkout. Use authorized, non-sensitive data. The report describes supplied records and does not change external systems.

Agent API guide → · Website orders show the report on your private order page.

The complete checkout request must fit within 40,000 UTF-8 bytes. Your input is validated again before an order is created.