A faster capacity scaling algorithm for minimum cost submodular flow

• 1 March 2002
• journal article
• Published by Springer Nature in Mathematical Programming
• Vol. 92  (1) , 119-139
• https://doi.org/10.1007/s101070100253

Abstract

Keywords

• FUNCTION
• PATH
• MINIMUM COST
• SUBMODULAR FLOW
• ARC CAPACITY
• ALGORITHM MODIFIED

All Related Versions

• Version 1, RePEc (Unconfirmed version)