Pages that link to "Item:Q2276885"
From MaRDI portal
The following pages link to An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes (Q2276885):
Displaying 24 items.
- Non polyhedral convex envelopes for 1-convex functions (Q312465) (← links)
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes (Q524905) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- A new reformulation-linearization technique for bilinear programming problems (Q1201905) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762) (← links)
- Convex envelopes of bivariate functions through the solution of KKT systems (Q1756774) (← links)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
- Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
- Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems (Q2010090) (← links)
- Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes (Q2064282) (← links)
- Convex envelopes for ray-concave functions (Q2080818) (← links)
- The value of shape constraints in discrete moment problems: a review and extension (Q2095900) (← links)
- Exact and approximate results for convex envelopes of special structured functions over simplices (Q2141722) (← links)
- A technique to derive the analytical form of convex envelopes for some bivariate functions (Q2250092) (← links)
- Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model (Q2432886) (← links)
- Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program (Q2450669) (← links)
- On convex envelopes for bivariate functions over polytopes (Q2452372) (← links)
- Tight convex relaxations for the expansion planning problem (Q2671451) (← links)
- The bipartite Boolean quadric polytope (Q2673249) (← links)
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex (Q2954391) (← links)
- The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
