Pages that link to "Item:Q2367913"
From MaRDI portal
The following pages link to A lift-and-project cutting plane algorithm for mixed 0-1 programs (Q2367913):
Displaying 8 items.
- Elementary closures for integer programs. (Q5937498) (← links)
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective (Q6057717) (← links)
- A note on the SDP relaxation of the minimum cut problem (Q6064052) (← links)
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts (Q6086008) (← links)
- Quantifying the benefits of customized vaccination strategies: A network‐based optimization approach (Q6150225) (← links)
- Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set (Q6179697) (← links)