{"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","summary":"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.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-07","reactions":{},"formalized":true,"formalizes":[{"title":"Modern computational approaches to nonlinear discrete optimization and applications in process systems engineering","identifier":"","relationship":"adapts"}]}