OPTFIN.ORGMultidisciplinary Research Laboratory for Operations Research and AI
Sign in

You are browsing anonymously. A verified sign-in is required before any personal or project data can appear.

IMPLEMENTED_NOT_INDEPENDENTLY_VERIFIEDTruck + drone

ALGORITHM ARTICLE

Weighted-interval sortie DP

Problem. Maximum-saving nonoverlapping sorties on a fixed truck tour.

Core idea. Take-or-skip recurrence over intervals ordered by rendezvous position.

Procedure

  1. Sort candidates.
  2. Find each compatible predecessor.
  3. Recover the exact best interval set.

Certificate. Exact recurrence and feasible recovered set.

Data structures and API

from optfin_orlab import TruckDroneProblem

solver = TruckDroneProblem()
result = solver.solve_interval_dp(...)

Complexity. O(m²) with direct predecessor search

Limits. General conflicts need set packing.

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.
  • CorrectnessExact recurrence and feasible recovered set.
  • ComplexityO(m²) with direct predecessor search
  • Operational limitGeneral conflicts need set packing.
  • ReproductionSource, executable test and evidence route remain linked.
View sourceOpen executable testReproduce evidence

LUNA ACADEMIC

Continue this algorithm in one research conversation.

Ask for the paper trail, executable test, source explanation, or a reproducibility plan for Weighted-interval sortie DP.

Open Luna for this algorithm

Back to the algorithm blog