Finite sequence routing formulations and continuous timing
Source: github.com/bernalde/sequence-routing-formulations/tree/6272…
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.
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-07-000012
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-07-000012/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-07-000012/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'