Login / Signup
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks.
Arie Tamir
Published in:
Math. Program. (1993)
Keyphrases
</>
series parallel
redundancy allocation
semidefinite
optimization problems
objective function
computational complexity
minimum cost
multicommodity flow problems
knowledge representation
np complete
approximation algorithms