Pages that link to "Item:Q2392118"
From MaRDI portal
The following pages link to Finding largest small polygons with gloptipoly (Q2392118):
Displaying 8 items.
- An efficient DC programming approach for portfolio decision with higher moments (Q409263) (← links)
- Using symbolic calculations to determine largest small polygons (Q2046342) (← links)
- Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing (Q2397437) (← links)
- Largest small polygons: a sequential convex optimization approach (Q2688919) (← links)
- Maximal Area of Equilateral Small Polygons (Q4575233) (← links)
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134) (← links)
- Small polygons with large area (Q6123561) (← links)
- Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons (Q6156093) (← links)
