Approximation Algorithm for A Bicriteria Multicommodity Flow Problem
In the present work,one of bicriteria multicommodity flow problem,called as Maximum Flow Problem with Minimized Maximum of Met Rates,is proposed to find a certain kind of weak solutions for the operational decisions of many practical situations with multicommodity flow,for instance,the emergency logistics distribution decision stemming from the action of Chinas reliving the areas suffering the tremendous snow disaster in the beginning of 2008.For the problem,the existence of solutions is proved,a pseudopolynomial time approximation algorithm to solve it is designed,finally an approximation measure on the algorithm we design is proposed and proved.
network multicommodity flow approximation algorithm
Congdian Cheng Henyong Tang Chuanli Zhao
College of Mathematics and Systems Science,Shenyang Normal University,Shenyang,Liaoning Province 110034,Peoples Republic of China
国际会议
北京
英文
2008-10-12（万方平台首次上网日期，不代表论文的发表时间）