Currently displaying 1 – 14 of 14

Showing per page

Order by Relevance | Title | Year of publication

A note to independent sets in scheduling

Jan Černý — 1995

Applications of Mathematics

The paper studies the bus-journey graphs in the case when they are piecewise expanding and contracting (if described by fathers-sons relations starting with the greatest independent set of nodes). This approach can make it possible to solve the minimization problem of the total service time of crews.

Location of polygon vertices on circles and its application in transport studies

Ján ČernýFilip Guldan — 1987

Aplikace matematiky

The paper deals with the problem how to locate a set of polygon vertices on given circles fulfilling some criteria of "regularity" of individual and composed polygons. Specifying the conditions we can obtain a lot of particular versions of this general problem. Some of them are already solved, the others are not. Applications of this theory can be found in scheduling of periodically repeating processes, e.g. in coordination of several urban lines on a common leg, in optimization of the rhythm of...

Page 1

Download Results (CSV)