摘要
选址问题作为一个古老的问题,有百年的发展历程。一般将其分为两种基本类型:连续型和离散型。前者也称为平面上的选址问题,其研究方法多属微积分及数学规划方面;后者也称为网络上的选址问题,其研究方法多与组合分析密切相关。本文提出一个生活中的实例——超市网点的布设,通过分析,提出可能的解决方法,获得最优解。
Location problem is an ancient problem with more than one hundred years of development history. This problem can be divided into two basic types：The one is continuous and the other is discrete. The former is also known as the planar location problem.Its research methods include the calculus and mathematical programming aspects;the latter is also known as the network location problem. The research methods are combined analysis.This is a problem in our life--the supermarket location. We can get the optimal solution from a variety of possible solutions.
出处
《西昌学院学报（自然科学版）》
2014年第3期28-31,共4页
Journal of Xichang University(Natural Science Edition)
关键词
选址问题
重心法
分枝定界法
覆盖
location problem
centroid method
branch and bound method
covering
