A trichotomy theorem shows that the logarithmic scale of cumulative cut strength determines whether cuts prove all, part, or none of the target bound in minimal branch-and-cut trees.
Lower bounds on the size of general branch-and-bound trees.Mathematical Programming, 198(1):539–559, 2023
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model
A trichotomy theorem shows that the logarithmic scale of cumulative cut strength determines whether cuts prove all, part, or none of the target bound in minimal branch-and-cut trees.