Two strongly polynomial cut cancelling algorithms for minimum cost network flow
1993 ◽
Vol 46
(2)
◽
pp. 133-165
◽
2005 ◽
Vol 82
(5)
◽
pp. 609-616
Keyword(s):
2013 ◽
Vol 23
(1)
◽
pp. 3-17
◽
1988 ◽
Vol 13
(1)
◽
pp. 125-190
◽
Keyword(s):
Keyword(s):
2017 ◽
Vol 30
(2)
◽
pp. 220
Keyword(s):
Keyword(s):