A finite descent method for Steiner's problem of inpolygons with minimal circumference

DOI10.1080/02331938608843141zbMath0602.90107OpenAlexW2053450955MaRDI QIDQ3738935

No author found.

Publication date: 1986

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938608843141

zbMATH Keywords

convex polygondiscrete optimizationdescent modelminimal circumferenceoptimal inpolygon

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Combinatorial optimization (90C27) Inequalities and extremum problems involving convexity in convex geometry (52A40) Other problems of combinatorial convexity (52A37) Convex sets in (2) dimensions (including convex curves) (52A10) Polytopes and polyhedra (52Bxx)

Related Items (5)

A fast modification of Focke's shortest inpolygon construction ⋮ Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner ⋮ The inpolygon with minimal area and the cirenmpolygon ⋮ Shortest polygonal paths in space ⋮ The circumpolygon with maximal area

This page was built for publication: A finite descent method for Steiner's problem of inpolygons with minimal circumference