The following pages link to Backdoor Branching (Q3009762):
Displaying 8 items.
- DASH: dynamic approach for switching heuristics (Q320816) (← links)
- Branching on nonchimerical fractionalities (Q439902) (← links)
- Restrict-and-relax search for 0-1 mixed-integer programs (Q743638) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (Q2140266) (← links)
- Learning pseudo-backdoors for mixed integer programs (Q2170189) (← links)
- On learning and branching: a survey (Q2408515) (← links)
- Improving strong branching by domain propagation (Q2513744) (← links)