A branch-price-and-cut method with lifted TSP-optimality cuts solves fair vehicle routing instances up to 25 customers with 0.27% average gap on hard cases.
Anewbranch-and- cutalgorithmforthecapacitatedvehicleroutingproblem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes
A branch-price-and-cut method with lifted TSP-optimality cuts solves fair vehicle routing instances up to 25 customers with 0.27% average gap on hard cases.