摘要
为解决本地通信子网连接设计中经常产生的集中器位置问题,建立了集中器位置不固定的集中器位置问题模型,这是个0-1规划问题.然后将目标函数转化为一维线性形式,使用0-1规划的隐数法来求解.
The concentrator location problem arises frequently in the designs of local area networks. The model of the concentrator location problem in which the location of the concentrators is not fixed is an optimization problem of zero-one integer programming. It can be solved with implicit enumeration after its objective function is rearranged to be linear.
出处
《北京师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2006年第4期376-378,共3页
Journal of Beijing Normal University(Natural Science)
关键词
集中器位置问题
隐数法
局部访问网络
concentrator location problem
implicit enumeration
local access network
