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


A partitioning algorithm for the multicommodity network flow problem
Authors:M D Grigoriadis  W W White
Institution:(1) IBM Data Processing Division, New York, N.Y., USA;(2) IBM Scientific Center, Philadelphia, Pa., USA
Abstract:A partitioning algorithm for solving the general minimum cost multicommodity flow problem for directed graphs is presented in the framework of a network flow method and the dual simplex method. A working basis which is considerably smaller than the number of capacitated arcs in the given network is employed and a set of simple secondary constraints is periodically examined. Some computational aspects and preliminary experimental results are discussed.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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