Weakly and strongly polynomial algorithmsforcomputingthemaximum decrease in uniform arc capacities

  • M. Ghiyasvand

Abstract

In this paper, a new problem on a directed network is presented. Let D be a feasible network such that all arc capacities are equal to U. Given a τ &gt
Published
2016-10-11
How to Cite
GHIYASVAND, M.. Weakly and strongly polynomial algorithmsforcomputingthemaximum decrease in uniform arc capacities. Yugoslav Journal of Operations Research, [S.l.], v. 26, n. 2, oct. 2016. ISSN 2334-6043. Available at: <https://yujor.fon.bg.ac.rs/index.php/yujor/article/view/517>. Date accessed: 24 apr. 2025.
Citation Formats
Issue
Vol 26 No 2 (2016)
Section
Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.