Strongly Polynomial-Time Truthful Mechanisms in One Shot

2006 ◽  
pp. 377-388 ◽  
Author(s):  
Paolo Penna ◽  
Guido Proietti ◽  
Peter Widmayer
Keyword(s):  
Polynomial Time ◽  
Strongly Polynomial Time ◽  
Strongly Polynomial

scholarly journals Efficient algorithm for Minimum cost flow problem with partial lane reversals

2019 ◽  
Vol 36 (1-2) ◽  
pp. 51-59
Author(s):  
Urmila Pyakurel
Keyword(s):  
Polynomial Time ◽  
Flow Problem ◽  
Minimum Cost ◽  
Minimum Cost Flow ◽  
Strongly Polynomial Time ◽  
Parallel Networks ◽  
Minimum Cost Flow Problem ◽  
Parallel Network ◽  
Cost Flow ◽  
Strongly Polynomial

In this paper, we investigate the minimum cost flow problem in two terminal series parallel network. We present modified minimum cost flow algorithm that computes the maximum dynamic and the earliest arrival flows in strongly polynomial time and also preserves all unused arc capacities. We also present strongly polynomial time minimum cost partial contraflow algorithm that solves both problems with partial reversals of arc capacities on two terminal series parallel networks.

Sign in / Sign up

Export Citation Format

Share Document