A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series—parallel networks
2013 ◽
Vol 41
◽
pp. 311-318
◽
1984 ◽
Vol 18
(3)
◽
pp. 377-387
◽
1989 ◽
Vol 14
(1)
◽
pp. 60-69
◽
Keyword(s):
Keyword(s):
2019 ◽
Vol 36
(1-2)
◽
pp. 51-59