Extremal problems for convex polygons
From MaRDI portal
Publication:2460117
Recommendations
Cites work
- A $1 Problem
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A correction to ``The largest small \(n\)-dimensional polytope with \(n+3\) vertices [J. Combin. Theory Ser. A 102 (2003) 401-409]
- A discrete isoperimetric problem
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A new reformulation-linearization technique for bilinear programming problems
- A note on the sum of distances under a diameter constraint
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Algorithme d'encadrement de l'optimum global d'une fonction différentiable
- Averaging distances in real quasihypermetric Banach spaces of finite dimension
- Case studies in evolutionary experimentation and computation
- Deterministic global optimization using interval constraint propagation techniques
- Global Optimization in Geometry — Circle Packing into the Square
- scientific article; zbMATH DE number 3901545 (Why is no real title available?)
- scientific article; zbMATH DE number 4067746 (Why is no real title available?)
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 480231 (Why is no real title available?)
- scientific article; zbMATH DE number 1543292 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 3339161 (Why is no real title available?)
- scientific article; zbMATH DE number 3056661 (Why is no real title available?)
- scientific article; zbMATH DE number 3099159 (Why is no real title available?)
- Isodiametric problems for polygons
- On convex polygons of maximal width
- On extremal point disributions in the Euclidean plane
- On Sets of Distances of n Points
- The Isoperimetric Problem
- The largest small \(n\)-dimensional polytope with \(n+3\) vertices.
- The largest small hexagon
- The largest small octagon
- The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal
- The small octagon with longest perimeter
- Unsolved problems in geometry
- Über eine Punktverteilung auf der Kugel
Cited in
(40)- Isoperimetric polygons of maximum width
- Extremal polygon containment problems
- A bird's eye-view of min-max and max-min functionals
- Crystals, gauges, podals, and polars.
- The small octagons of maximal width
- On convex polygons of maximal width
- Using symbolic calculations to determine largest small polygons
- Global exact optimization for covering a rectangle with 6 circles
- Extremal problems for spherical convex polygons
- Numerical certification of Pareto optimality for biobjective nonlinear problems
- Extremal areas of polygons with fixed perimeter
- An extremum problem for the power moment of a convex polygon contained in a disc
- Characterization of extremal antipodal polygons
- Open sets avoiding integral distances
- Finding largest small polygons with gloptipoly
- Maximal perimeter, diameter and area of equilateral unit-width convex polygons
- Largest small polygons: a sequential convex optimization approach
- Extremal area of polygons sliding along curves
- Asymmetric polygons with maximum area
- Finding Extremal Polygons
- scientific article; zbMATH DE number 3131086 (Why is no real title available?)
- scientific article; zbMATH DE number 5302813 (Why is no real title available?)
- An extremum problem for convex polygons
- On the mean length of the diagonals of an \(n\)-gon
- scientific article; zbMATH DE number 4067746 (Why is no real title available?)
- Inpolygons of minimal diameter
- Recognition of largest empty orthoconvex polygon in a point set
- scientific article; zbMATH DE number 4198018 (Why is no real title available?)
- scientific article; zbMATH DE number 5589231 (Why is no real title available?)
- Extremal problems for framed polygons
- Enumerating isodiametric and isoperimetric polygons
- scientific article; zbMATH DE number 3103938 (Why is no real title available?)
- A note on diameters of point sets
- Piece adding technique for convex maximization problems
- A literature review on circle and sphere packing problems: models and methodologies
- Small polygons with large area
- Some extremal problems for polygons in the Euclidean plane
- The small hexagon and heptagon with maximum sum of distances between vertices
- Global optimization for Heilbronn problem of convex polygons based on bilinear matrix inequalities solving
- A zonogon approach for computing small convex polygons of maximum perimeter
This page was built for publication: Extremal problems for convex polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460117)