Pages that link to "Item:Q2129197"
From MaRDI portal
The following pages link to A disjunctive cut strengthening technique for convex MINLP (Q2129197):
Displaying 10 items.
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- Announcement: Howard Rosenbrock prize 2021 (Q2168619) (← links)
- A convex-analysis perspective on disjunctive cuts (Q2492679) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs (Q3186647) (← links)
- (Q3801338) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
- Announcement: Howard Rosenbrock Prize 2022 (Q6074061) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023 (Q6544493) (← links)