Pages that link to "Item:Q1949256"
From MaRDI portal
The following pages link to Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256):
Displaying 9 items.
- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) (Q5096937) (← 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)
- Global optimization of general non-convex problems with intermediate bilinear substructures (Q5746708) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- A new technique to derive tight convex underestimators (sometimes envelopes) (Q6155069) (← links)
- On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903) (← links)
- Dynamic inventory system with pricing adjustment for price-comparison shoppers (Q6581479) (← links)
- MIP relaxations in factorable programming (Q6601201) (← links)