ALGORITHM ARTICLE
Synchronization-state exact DP
Problem. Exact makespan for the clean one-truck/one-drone kernel on small instances.
Core idea. A state needs the served mask and the common synchronization node.
Procedure
- Enumerate truck and synchronized-sortie transitions.
- Solve required truck subset paths exactly.
- Return the least-makespan depot state.
Certificate. Small-instance exact replay; W03 independent verification remains pending.
Data structures and API
from optfin_orlab import TruckDroneProblem
solver = TruckDroneProblem()
result = solver.solve_exact(...)Complexity. Exponential subset DP
Limits. No quantum-advantage claim and no assumption that all truck/drone speeds are proportional.
OPTFIN AUDIT CHECKS
What has to reconcile before this method is trusted.
- DefinitionProblem, objective, inputs and output are explicit.
- Data structureThe public API and canonical source path are identified.
- CorrectnessSmall-instance exact replay; W03 independent verification remains pending.
- ComplexityExponential subset DP
- Operational limitNo quantum-advantage claim and no assumption that all truck/drone speeds are proportional.
- ReproductionSource, executable test and evidence route remain linked.
LUNA ACADEMIC
Continue this algorithm in one research conversation.
Ask for the paper trail, executable test, source explanation, or a reproducibility plan for Synchronization-state exact DP.
Open Luna for this algorithm