Showing papers by "Peter Brucker published in 1985"

TL;DR: It is shown that an acyclic multigraph with a single source and a single sink is series-parallel if and only if for arbitrary linear cost functions and arbitrary capacities the corresponding minimum cost flow problem can be solved by a greedy algorithm.

TL;DR: An out-of-kilter method is developed for circulation problems with algebraic objectives which solves problems with lower capacities and negative arc costs and shows that the algebraic circulation problem is polynomially solvable.