Previous |  Up |  Next


maximizing distances of regular polygons on a circle; transport problems; $M$-system; $M$-graph; determination of optimal solution; bus line scheduling
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).
[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
Partner of
EuDML logo