%0 Journal Article %1 journals/algorithms/DellAmicoJM24 %A Dell'Amico, Mauro %A Jamal, Jafar %A Montemanni, Roberto %D 2024 %J Algorithms %K dblp %N 1 %P 12 %T Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times. %U http://dblp.uni-trier.de/db/journals/algorithms/algorithms17.html#DellAmicoJM24 %V 17

@article{journals/algorithms/DellAmicoJM24, added-at = {2024-02-29T00:00:00.000+0100}, author = {Dell'Amico, Mauro and Jamal, Jafar and Montemanni, Roberto}, biburl = {https://www.bibsonomy.org/bibtex/2a8f6cd94349be077151bb490aa0b6114/dblp}, ee = {https://doi.org/10.3390/a17010012}, interhash = {95b11b0ff3c7d237d33d0a0da84c7199}, intrahash = {a8f6cd94349be077151bb490aa0b6114}, journal = {Algorithms}, keywords = {dblp}, number = 1, pages = 12, timestamp = {2024-04-09T05:19:01.000+0200}, title = {Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times.}, url = {http://dblp.uni-trier.de/db/journals/algorithms/algorithms17.html#DellAmicoJM24}, volume = 17, year = 2024 }