Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1, p. 7 — q-routes for the scaled demands ⌈dᵥ/g⌉ and capacity ⌊C/g⌋ are valid q-routes

Proved
RobustBCPCVRP.Formulation.scaling_valid

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

column-generationinteger-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1vehicle-routing

Let G=(V,E)G=(V,E)G=(V,E) be a graph with integer demands dv≥0d_v\ge 0dv​≥0 and integer capacity CCC, and let g>1g>1g>1 be an integer. Define the scaled demands and capacity

dv′(g)=⌈dv/g⌉,C′=⌊C/g⌋.d'_v(g)=\lceil d_v/g\rceil,\qquad C'=\lfloor C/g\rfloor .dv′​(g)=⌈dv​/g⌉,C′=⌊C/g⌋.

Every q-route without 2-cycles for the scaled data (d′,C′)(d',C')(d′,C′) is a q-route without 2-cycles for the original data (d,C)(d,C)(d,C); in particular its original load is at most CCC.

This is the correctness of the scaling acceleration of the pricing: the dynamic program run on the scaled instance takes time proportional to C′C'C′ instead of CCC, and the columns it finds remain valid.

Formalization Note ⌈⋅⌉\lceil\cdot\rceil⌈⋅⌉ and ⌊⋅⌋\lfloor\cdot\rfloor⌊⋅⌋ are taken over the rationals (⌈(d v : ℚ) / g⌉₊, ⌊(C : ℚ) / g⌋₊).

Preamble
import Mathlib
import Definitions.Def_LysgaardCVRP_Shrink_cut
import Definitions.Def_LysgaardCVRP_Shrink_roundedCapacityBound
import Definitions.Def_RobustBCPCVRP_Formulation_Setting
import Definitions.Def_RobustBCPCVRP_Formulation_Polytopes
open LysgaardCVRP.Shrink
Formal statement
namespace RobustBCPCVRP.Formulation
theorem scaling_valid {n : ℕ} (E : Finset (Sym2 (Fin (n + 1))))
    (d : Fin (n + 1) → ℕ) (C g : ℕ) (hg : 1 < g) (r : List (Fin (n + 1)))
    (hr : IsQRoute E (fun v => ⌈(d v : ℚ) / g⌉₊) ⌊(C : ℚ) / g⌋₊ r) :
    IsQRoute E d C r := by sorry
end RobustBCPCVRP.Formulation
Source
Fukasawa, Longo, Lysgaard, Poggi de Aragão, Reis, Uchoa & Werneck, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Math. Program. (DOI 10.1007/s10107-005-0644-x); accepted manuscript, p. 7, §3.1, Heuristic Acceleration, scaling
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

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

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