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.
Further results on an abstract model for branching and its application to mixed integer programming.Mathematical Programming, 190(1):811–841, 2021
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.