Suchergebnisse - "combinatorial strongly polynomial algorithm"

Inverse Polymatroidal Flow Problem: Inverse polymatroidal flow problem

Autoren: Mao-cheng Cai Xiaoguang Yang Yanjun Li

Quelle: Journal of Combinatorial Optimization. 3:115-126

Schlagwörter: combinatorial strongly polynomial algorithm, minimum cost circulation, 0211 other engineering and technologies, inverse problem, polymatroidal flow, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, Combinatorial aspects of matroids and geometric lattices, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1339732
https://doi.org/10.1023/a:1009877408258
https://link.springer.com/content/pdf/10.1023/A:1009877408258.pdf
https://link.springer.com/article/10.1023/A%3A1009877408258
https://dblp.uni-trier.de/db/journals/jco/jco3.html#CaiYL99

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