Pages that link to "Item:Q2061899"
From MaRDI portal
The following pages link to Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899):
Displayed 6 items.
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
- An abstract model for branch-and-cut (Q2164714) (← links)
- Compressing branch-and-bound trees (Q6086013) (← links)
- On polytopes with linear rank with respect to generalizations of the split closure (Q6122082) (← links)
- A theoretical and computational analysis of full strong-branching (Q6126652) (← links)