An $$O(mn \log U)$$ O ( m n log U ) time algorithm for estimating the maximum cost of adjusting an infeasible network
Crossref DOI link: https://doi.org/10.1007/s11235-016-0151-9
Published Online: 2016-03-11
Published Print: 2016-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ghiyasvand, Mehdi
Text and Data Mining valid from 2016-03-11