Maximization of distances of regular polygons on a circle. (English) Zbl 0444.90101


90C35 Programming involving graphs or networks
90C08 Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
65K05 Numerical mathematical programming methods
90B35 Deterministic scheduling theory in operations research
Full Text: DOI EuDML


[1] J. Černý: Problems for systems of regular polygons on a circumference and their application in transport. (Czech). Matematické obzory (1972), 51 - 59.
[2] J. Černý: Applied mathematics and transport. (Czech). Pokroky matematiky, fyziky a astronomie 19 (1974), 316-323.
[3] F. Harrary: Graph Theory. Addison-Wesley, 1969.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.