Standard
Harvard
Gainanov, D, Mladenović, N
& Rasskazova, V 2021,
Simplicial Vertex Heuristic in Solving the Railway Arrival and Departure Paths Assignment Problem. in N Mladenovic, A Sleptchenko, A Sifaleras & M Omar (eds),
Variable Neighborhood Search - 8th International Conference, ICVNS 2021, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12559 LNCS, Springer, pp. 123-137, 8th International Conference on Variable Neighborhood Search, ICVNS 2021, Abu Dhabi, United Arab Emirates,
21/03/2021.
https://doi.org/10.1007/978-3-030-69625-2_10
APA
Gainanov, D., Mladenović, N.
, & Rasskazova, V. (2021).
Simplicial Vertex Heuristic in Solving the Railway Arrival and Departure Paths Assignment Problem. In N. Mladenovic, A. Sleptchenko, A. Sifaleras, & M. Omar (Eds.),
Variable Neighborhood Search - 8th International Conference, ICVNS 2021, Proceedings (pp. 123-137). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12559 LNCS). Springer.
https://doi.org/10.1007/978-3-030-69625-2_10
Vancouver
Author
BibTeX
@inproceedings{e8674b1c280a48b799e1b1b72e23fa2b,
title = "Simplicial Vertex Heuristic in Solving the Railway Arrival and Departure Paths Assignment Problem",
keywords = "Maximum independent set, Path assignment problem, Railway logistics",
author = "Damir Gainanov and Nenad Mladenovi{\'c} and Varvara Rasskazova",
year = "2021",
doi = "10.1007/978-3-030-69625-2_10",
language = "English",
isbn = "9783030696245",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "123--137",
editor = "Nenad Mladenovic and Andrei Sleptchenko and Angelo Sifaleras and Mohammed Omar",
booktitle = "Variable Neighborhood Search - 8th International Conference, ICVNS 2021, Proceedings",
address = "Germany",
note = "8th International Conference on Variable Neighborhood Search, ICVNS 2021 ; Conference date: 21-03-2021 Through 25-03-2021",
}
RIS
TY - GEN
T1 - Simplicial Vertex Heuristic in Solving the Railway Arrival and Departure Paths Assignment Problem
AU - Gainanov, Damir
AU - Mladenović, Nenad
AU - Rasskazova, Varvara
PY - 2021
Y1 - 2021
KW - Maximum independent set
KW - Path assignment problem
KW - Railway logistics
UR - http://www.scopus.com/inward/record.url?scp=85103512699&partnerID=8YFLogxK
UR - https://elibrary.ru/item.asp?id=46765708
U2 - 10.1007/978-3-030-69625-2_10
DO - 10.1007/978-3-030-69625-2_10
M3 - Conference contribution
AN - SCOPUS:85103512699
SN - 9783030696245
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 123
EP - 137
BT - Variable Neighborhood Search - 8th International Conference, ICVNS 2021, Proceedings
A2 - Mladenovic, Nenad
A2 - Sleptchenko, Andrei
A2 - Sifaleras, Angelo
A2 - Omar, Mohammed
PB - Springer
T2 - 8th International Conference on Variable Neighborhood Search, ICVNS 2021
Y2 - 21 March 2021 through 25 March 2021
ER -