A polynomial time algorithm for the minimum flow problem in time-varying networks
Crossref DOI link: https://doi.org/10.1007/s10479-017-2450-2
Published Online: 2017-02-28
Published Print: 2019-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Khodayifar, S. http://orcid.org/0000-0002-8331-3058
Raayatpanah, M. A.
Pardalos, P. M.
Text and Data Mining valid from 2017-02-28