Article
MSC:
52A37,
65K05,
90B05,
90B35,
90C08,
90C35 | MR 0568524 | Zbl 0444.90101 | DOI: 10.21136/AM.1980.103850
Full entry |
PDF
(1.6 MB)
Feedback
PDF
(1.6 MB)
Feedback
Keywords:
maximizing distances of regular polygons on a circle; transport problems; $M$-system; $M$-graph; determination of optimal solution; bus line scheduling
maximizing distances of regular polygons on a circle; transport problems; $M$-system; $M$-graph; determination of optimal solution; bus line scheduling
Summary:
This paper presents the solution of a basic problem defined by J. Černý which solves a concrete everyday problem in railway and road transport (the problem of optimization of time-tables by some criteria).
References:
[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. MR 0469252
[3] F. Harrary: Graph Theory. Addison-Wesley, 1969. MR 0256911
Search
Partner of
