Capacity-class cuts (RCI/multistar) lift CPTP B&C from 52 to 64 of 76 instances solved and shrink the tree >10×; comb, RGLM, fixing, propagation, and SPI add nothing measurable on the open HiGHS stack.
Resource constrained shortest path problems in path planning for fleet management.Journal of Mathematical Modelling and Algorithms, 3(1):1–17, 2004
1 Pith paper cite this work, alongside 22 external citations. Polarity classification is still indexing.
1
Pith paper citing it
22
external citations · external index
fields
math.OC 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
An open, reproducible branch-and-cut for the capacitated profitable tour problem: a component study
Capacity-class cuts (RCI/multistar) lift CPTP B&C from 52 to 64 of 76 instances solved and shrink the tree >10×; comb, RGLM, fixing, propagation, and SPI add nothing measurable on the open HiGHS stack.