Weakly and strongly polynomial algorithms for computing the maximum decrease in uniform arc capacities

DOI10.2298/YJOR141217015GMaRDI QIDQ5279769zbMATH OpenOpenAlexFDO

Authors Mehdi Ghiyasvand

Publication date 19 July 2017

Published in Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/yjor141217015g

zbMATH Keywords

feasible flowmaximum flowoptimal witness

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18)

Recommendations

• Maximum flow in a network with an underestimated arc capacity
• On the maximum capacity augmentation algorithm for the maximum flow problem
• scientific article; zbMATH DE number 4079141
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• The capacity expansion problem on directed networks

This page was built for publication: Weakly and strongly polynomial algorithms for computing the maximum decrease in uniform arc capacities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5279769)