A worst-bound branching heuristic is proven size-optimal for fixed variable selection and empirically produces much tighter lower bounds for the minimum bandwidth problem than depth-first or breadth-first branching.
INFORMS Journal on Computing 23:26--40
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimization Bounds from the Branching Dual
A worst-bound branching heuristic is proven size-optimal for fixed variable selection and empirically produces much tighter lower bounds for the minimum bandwidth problem than depth-first or breadth-first branching.