Pages that link to "Item:Q2687063"
From MaRDI portal
The following pages link to Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063):
Displaying 7 items.
- On \(t\)-branch split cuts for mixed-integer programs (Q378102) (← links)
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques (Q1863894) (← links)
- (Q4735935) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- Equalizer zero-determinant strategy in discounted repeated Stackelberg asymmetric game (Q6130962) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q6336516) (← links)
- An abstract model for branch and cut (Q6589748) (← links)
