Pages that link to "Item:Q857420"
From MaRDI portal
The following pages link to The small octagon with longest perimeter (Q857420):
Displaying 18 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Enumerating isodiametric and isoperimetric polygons (Q543911) (← links)
- The small hexagon and heptagon with maximum sum of distances between vertices (Q628747) (← links)
- Isoperimetric polygons of maximum width (Q1006404) (← links)
- The small octagons of maximal width (Q1953053) (← links)
- Tight bounds on the maximal perimeter and the maximal width of convex small polygons (Q2089891) (← links)
- Extremal problems for spherical convex polygons (Q2131246) (← links)
- Numerical certification of Pareto optimality for biobjective nonlinear problems (Q2154462) (← links)
- Tight bounds on the maximal perimeter of convex equilateral small polygons (Q2166356) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Maximal perimeter, diameter and area of equilateral unit-width convex polygons (Q2392128) (← links)
- Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing (Q2397437) (← links)
- Extremal problems for convex polygons (Q2460117) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Maximal Area of Equilateral Small Polygons (Q4575233) (← links)
- Small polygons with large area (Q6123561) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023 (Q6544493) (← links)
