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

Fixed-tour sortie set-packing B&B

Problem. Exact compatible-sortie selection for a fixed truck tour.

Core idea. Represent candidate conflicts as binary set-packing inequalities.

Procedure

  1. Create candidate variables.
  2. Add conflict constraints.
  3. Maximize saving with exact B&B.

Certificate. Feasible selected set and bounded binary tree.

Data structures and API

from optfin_orlab import TruckDroneProblem

solver = TruckDroneProblem()
result = solver.solve_branch_and_bound(...)

Complexity. Exponential worst case

Limits. Certifies only the enumerated fixed-tour candidates.

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.
  • CorrectnessFeasible selected set and bounded binary tree.
  • ComplexityExponential worst case
  • Operational limitCertifies only the enumerated fixed-tour candidates.
  • 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 Fixed-tour sortie set-packing B&B.

Open Luna for this algorithm

Back to the algorithm blog