|
|||||
|
|
A faster polynomial algorithm for the constrained maximum flow problem |
|
| Authors: | Cenk Ç alışkan |
| Affiliation: | Department of Finance and Economics, Woodbury School of Business, Utah Valley University, Orem, UT 84058, United States |
| Abstract: | |
| Keywords: | Network flows Maximum flow Minimum cost network flow Scaling Computational complexity |
| 本文献已被 ScienceDirect 等数据库收录！ | |