Pages that link to "Item:Q1756762"
From MaRDI portal
The following pages link to On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762):
Displaying 6 items.
- Convex hull representations for bounded products of variables (Q2046306) (← links)
- Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes (Q2064282) (← links)
- Gaining or losing perspective (Q2124806) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
