文章基本信息

标题：Algorithm For Solving Weber Problem For a N-Sequentially Connected Chain
作者：Roman E. Shangin
期刊名称：European Researcher
印刷版ISSN：2219-8229
电子版ISSN：2224-0136
出版年度：2013
卷号：Rus
期号：1
出版社：European Researcher
摘要：Here is set the algorithm, which reasonably solves Veber problem for n-sequentially connected chain and finite set of points of location. Сomparison of action period of a given algorithm and a model of integer linear programming, which was realized in IBM ILOG CPLEX, is carried out.