| Autor: |
I. V. Rubanov, M. S. Barketau, M. Y. Kovalyov |
| Jazyk: |
ruština |
| Rok vydání: |
2018 |
| Předmět: |
|
| Zdroj: |
Informatika, Vol 15, Iss 1, Pp 21-33 (2018) |
| Druh dokumentu: |
article |
| ISSN: |
1816-0301 |
| Popis: |
Modeling of movement of objects without stops in a network of crossing routes is studied. The problem is formulated in terms of disjunctive linear programming, mixed integer linear programming and graph theory. Several variants for representing constraints on convergence of objects are considered. NP-completeness of the problem in the strong sense is proved. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
