Pages that link to "Item:Q2687056"

The following pages link to Lower bounds on the size of general branch-and-bound trees (Q2687056):

Displaying 14 items.

• Bounds on the size of branch-and-bound proofs for integer knapsacks (Q924879) (← links)
• On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
• A lower bound for tree resolution (Q1336637) (← links)
• An abstract model for branch-and-cut (Q2164714) (← links)
• New branch-and-bound algorithms for \(k\)-cardinality tree problems (Q2840678) (← links)
• Early estimates of the size of branch-and-bound trees (Q2892274) (← links)
• Estimating the Size of Branch-and-Bound Trees (Q5085999) (← links)
• Lower Bounds for QBFs of Bounded Treewidth (Q5145651) (← links)
• A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth (Q5434404) (← links)
• A general lower bound for collaborative tree exploration (Q5919423) (← links)
• Compressing branch-and-bound trees (Q6086013) (← links)
• Complexity of optimizing over the integers (Q6160281) (← links)
• Lower Bounds on the Size of General Branch-and-Bound Trees (Q6363105) (← links)
• On computing small variable disjunction branch-and-bound trees (Q6589747) (← links)