首页 | 本学科首页   官方微博 | 高级检索  
     


Two new algorithms for minimal cost flow problems
Authors:Dr. W. Domschke
Affiliation:1. Institut für Wirtschaftstheorie und Operations Research der Universit?t (TH) Karlsruhe, Kaiserstra?e 12, D-7500, Karlsruhe 1, Bundesrepublik Deutschland
Abstract:Two new algorithms for minimal cost flow problems in lower and upper bound capacitated flow networks and an ALGOL-procedure for one of them are given. On the average both methods need less than half of the computing time of the Out-of-Kilter-algorithm.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号