Árgilán Viktor Sándor and Balogh János and Tóth Attila:
The basic problem of vehicle scheduling can be solved by maximum bipartite matching.
In:
ICAI 2014: Proceedings of the 9th International Conference on Applied Informatics, vol. 1-2.
Eszterházy Károly Tanárképző Főiskola (EKTF), Eger, pp. 209-218.
(2014)
ISBN 9786155297182
Preview |
Text
ICAI.9.2014.2.209.pdf - Published Version Download (1MB) | Preview |
| Creators: |
|
|||
|---|---|---|---|---|
| Item Type: | Book Section | |||
| Date: | 2014 | |||
| Number of Pages: | 10 | |||
| Page Range: | pp. 209-218 | |||
| ISBN: | 9786155297182 | |||
| Publisher: | Eszterházy Károly Tanárképző Főiskola (EKTF) | |||
| Place of Publication: | Eger | |||
| Faculty/Unit: | Gyula Juhász Faculty of Education | |||
| Institution: | University of Szeged (2000-) | |||
| Language: | English | |||
| MTMT rekordazonosító: | 2880537 | |||
| DOI azonosító: | https://doi.org/10.14794/ICAI.9.2014.2.209 | |||
| Date Deposited: | 2025. Feb. 10. 10:34 | |||
| Last Modified: | 2025. Feb. 10. 10:34 | |||
| URI: | http://publicatio.bibl.u-szeged.hu/id/eprint/35960 |
Actions (login required)
 |
View Item |
Download Statistics
Download Statistics
