Pages that link to "Item:Q4777060"
From MaRDI portal
The following pages link to Polyhedral convexity cuts and negative edge extensions (Q4777060):
Displaying 15 items.
- Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
- A finite procedure to generate feasible points for the extreme point mathematical programming problem (Q1103529) (← links)
- A finitely convergent procedure for facial disjunctive programs (Q1159568) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
- Enhanced intersection cutting-plane approach for linear complementarity problems (Q2565006) (← links)
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
- Facet inequalities from simple disjunctions in cutting plane theory (Q3707764) (← links)
- Optimization of linear-convex programs (Q3835613) (← links)
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts (Q3877412) (← links)
- Polyhedral annexation in mixed integer and combinatorial programming (Q4139972) (← links)
- Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
