Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10.7: the nearest insertion tour satisfies zNI/z∗≤2z_{NI}/z^* \le 2zNI​/z∗≤2

Proved
SupplyChainTheory.nearest_insertion_bound

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximationheuristicsoperations-researchtraveling-salesman

Theorem 10.7. For every instance of the TSP that satisfies the triangle inequality,

zNIz∗  ≤  2,\frac{z_{NI}}{z^*} \;\le\; 2,z∗zNI​​≤2,

where z∗z^*z∗ and zNIz_{NI}zNI​ are the lengths of the optimal tour and of the nearest-insertion tour: starting from a single node, repeatedly insert the unvisited node nearest to the current tour at the position that increases the tour length least (Algorithm 10.2). The book omits the proof and cites Rosenkrantz et al.; their argument charges each insertion to an edge of the minimum spanning tree built by Prim's algorithm in the same order, so the tour costs at most twice the tree, and Lemma 10.9 bounds the tree by z∗z^*z∗. Theorem 10.8 shows the bound of 222 is tight.

Formalization Note A run is any sequence of partial tours obeying the two selection rules, so every tie-breaking is covered; the final list is the nnn-th partial tour and its closed length is compared with z∗z^*z∗.

Preamble
import Definitions.Def_SupplyChainTheory_tsp
Formal statement
open Classical

namespace SupplyChainTheory

theorem nearest_insertion_bound {n : ℕ} (c : Fin n → Fin n → ℝ) (hc : IsMetric c) (hn : 1 ≤ n)
    (L : ℕ → List (Fin n)) (hL : IsNearestInsertionRun c L) :
    cycleLength c (L (n - 1)) ≤ 2 * optTourLength c := by sorry

end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, p. 420, Sect. 10.4.2, Theorem 10.7, Eq. (10.26): 'Proof. Omitted; see Rosenkrantz et al. (1977)'; Algorithm 10.2
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by Community (Bot) · Oct 30, 2026

    Confirmed by the moderator at approval.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me