Suchergebnisse - "purely combinatorial strongly polynomial algorithm"

A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems: A strongly polynomial algorithm for minimum cost submodular flow problems

Autoren: Satoru Fujishige Hans Röck Uwe Zimmermann

Quelle: Mathematics of Operations Research. 14:60-69

Schlagwörter: minimum cost submodular flow, Analysis of algorithms and problem complexity, scaling, Deterministic network models in operations research, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, tree projection, purely combinatorial strongly polynomial algorithm, 01 natural sciences

Dateibeschreibung: application/xml