The following pages link to Quantifying Double McCormick (Q4595965):
Displaying 11 items.
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations (Q1650771) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762) (← links)
- Experimental validation of volume-based comparison for double-McCormick relaxations (Q2011595) (← 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)
- A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
- A conic relaxation model for searching for the global optimum of network data envelopment analysis (Q2272317) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization (Q2331356) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
