Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
Crossref DOI link: https://doi.org/10.1007/s10472-016-9527-5
Published Online: 2016-09-28
Published Print: 2017-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Lauri, Mikko
Ropponen, Aino
Ritala, Risto
Funding for this research was provided by:
Suomen Akatemia (268152)
License valid from 2016-09-28