The small octagons of maximal width
From MaRDI portal
Publication:1953053
DOI10.1007/s00454-013-9489-xzbMath1269.52002OpenAlexW2056994687MaRDI QIDQ1953053
Frédéric Messine, Charles Audet, Pierre Hansen, Jordan Ninin
Publication date: 7 June 2013
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-013-9489-x
Related Items
A review of computation of mathematically rigorous bounds on optima of linear programs, The equilateral small octagon of maximal width, Tight bounds on the maximal perimeter and the maximal width of convex small polygons
Cites Work
- A reliable affine relaxation method for global optimization
- Enumerating isodiametric and isoperimetric polygons
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
- The small octagon with longest perimeter
- Isoperimetric polygons of maximum width
- The largest small hexagon
- Safe bounds in linear and mixed-integer linear programming
- The largest small octagon
- The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal
- On convex polygons of maximal width
- Affine arithmetic: concepts and applications
- Maximal perimeter, diameter and area of equilateral unit-width convex polygons
- Extremal problems for convex polygons
- A general reliable quadratic form: An extension of affine arithmetic
- Deterministic global optimization using interval constraint propagation techniques
- Standardized Interval Arithmetic and Interval Arithmetic Used in Libraries
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
