山东理工大学学报：自然科学版2012，Vol.26Issue(1)：70-73,4.
无容量限制设施选址问题的分支定界法
Branch and bound algorithm for the uncapacitated facility location problem
摘要
Abstract
Facility location problems are classical optimization problems.A good location method can save money efficiently,promote the coordination of production and consumption and obtain the balanced development of facility system.The competitive advantage of firms and the profitability of public facilities depend on the results of these locations.In this paper,uncapacitated facility location problem is introduced.We give a branch and bound method,which is an exact algorithm to solve this problem.Numerical examples illustrate this approach.关键词
设施选址问题/无容量限制/分支定界法Key words
facility location problem/uncapacitated/branch and bound分类
经济学引用本文复制引用
李翼,赵茂先,李岳佳..无容量限制设施选址问题的分支定界法[J].山东理工大学学报：自然科学版,2012,26(1):70-73,4.基金项目
山东省自然科学基金资助项目 （）
