Small Cost-Matrix Tour Workbench

How to use Small Cost-Matrix Tour Workbench

A subset dynamic program records the cheapest route to each last vertex after visiting an exact set. The final edge must return to your start. A reconstructed round trip visits every vertex once and is checked against the objective.

1. Enter square cost matrix json (null means unavailable), starting vertex (1-based).
2. Choose the stated convention and check the units and supported model.
3. Calculate, inspect the result, then copy or download it.

Good to know

• Exact-grid inputs are plain decimals with at most six places and magnitude≤1e9. Raw JSON number spelling is checked before conversion; decimal strings can preserve exact grid values. Exact rational intermediates are bounded to 8192 bits.2–12 vertices, nonnegative directed costs, diagonal zero, null for an unavailable off-diagonal arc. No coordinates, travel times, traffic, geocoding or navigation. Exact optimality is limited to the entered matrix; equal-cost tours return one deterministic witness.
• Local calculation only; no input persistence or external lookup. Text/JSON is limited to 30000 characters and output to 1000000 characters. Numeric model inputs and precision/work limits are stated on this page. Approximate JSON numbers retain full stored values; exact arithmetic outputs retain decimal or fraction strings. Unsupported states fail explicitly.