Id: palomar/PALOMAR-2026-11-07-000012 Url: https://github.com/bernalde/sequence-routing-formulations/tree/6272abea8b3e45a60a9a37a29413722c94929613 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-07-000012-v1.json Repo: https://github.com/bernalde/sequence-routing-formulations Tags: math.OC, msc:90C27, msc:90C11 Score: 0 Title: Finite sequence routing formulations and continuous timing Trust: high Domain: math.OC Source: palomar Authors: David E. Bernal Neira Reviews: 0 Subject: math.OC Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-07 Formalized: true Formalizes: title=Modern computational approaches to nonlinear discrete optimization and applications in process systems engineering identifier= relationship=adapts Page: https://delphi.science/r/palomar/PALOMAR-2026-11-07-000012 A qualified finite sequence-routing formalization connecting the complete source binary rows with padded elementary customer routes and exact transition cost. For fixed valid slots, explicit zero-depot clock/travel conditions give continuous timing feasibility through the earliest-schedule recurrence and an attained minimum total return over timing assignments. Capacity and global route optimization are outside scope.