Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/fedcsis/DellAmicoJM23
%A Dell'Amico, Mauro
%A Jamal, Jafar
%A Montemanni, Roberto
%B FedCSIS
%D 2023
%E Ganzha, Maria
%E Maciaszek, Leszek A.
%E Paprzycki, Marcin
%E Slezak, Dominik
%K dblp
%P 421-430
%T Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times.
%U http://dblp.uni-trier.de/db/conf/fedcsis/fedcsis2023.html#DellAmicoJM23
%V 35
%@ 978-83-969601-0-8
@inproceedings{conf/fedcsis/DellAmicoJM23,
added-at = {2023-11-28T00:00:00.000+0100},
author = {Dell'Amico, Mauro and Jamal, Jafar and Montemanni, Roberto},
biburl = {https://www.bibsonomy.org/bibtex/29c6e0bec4064ae3361c6fd726e4a789a/dblp},
booktitle = {FedCSIS},
crossref = {conf/fedcsis/2023},
editor = {Ganzha, Maria and Maciaszek, Leszek A. and Paprzycki, Marcin and Slezak, Dominik},
ee = {https://doi.org/10.15439/2023F6191},
interhash = {a9bbc0c31b521d84d1c9d25a81eea250},
intrahash = {9c6e0bec4064ae3361c6fd726e4a789a},
isbn = {978-83-969601-0-8},
keywords = {dblp},
pages = {421-430},
series = {Annals of Computer Science and Information Systems},
timestamp = {2024-04-29T07:11:24.000+0200},
title = {Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times.},
url = {http://dblp.uni-trier.de/db/conf/fedcsis/fedcsis2023.html#DellAmicoJM23},
volume = 35,
year = 2023
}