Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow - MaRDI portal

A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow

From MaRDI portal

Publication:5470761

Jump to:navigation, search

DOI10.1137/S0895480199361533zbMath1122.90069MaRDI QIDQ5470761

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno

Publication date: 1 June 2006

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimization submodular function network flow strongly polynomial time algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (1)

Submodular function minimization

This page was built for publication: A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5470761&oldid=30014047"