English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The assignment problem belongs to the main tasks of combinatorial optimization. This is a special case of the transport problem. Special methods that allow finding the optimal solution from the set of possible ones have been developed for solving the transport problem. The assignment problem is used in transport to optimize the arrangement of the cars along the routes, in the process of distributing the drivers among the cars, and in the process of distributing freights along the production lines. This article considers the case when m n &lt; during the search of optimal solutions in the assignment problem of a transport type. The authors offer an algorithm that allows us to build a bus schedule taking into account the current restrictions in the presence of which the passenger traffic is carried out. A theoretical assessment of time complexity of an offered procedure for constructing all optimal solutions to the assignment problem is presented. An example illustrating the operation of the constructed algorithm, which allows finding the whole set of optimal solutions in polynomial time is given. Recommendations on the use of the algorithm in practice are given.

About one aspect of effective building of bus traffic schedule with an approximate algorithm