摘要
研究了一类带有转移费用的离散序列搜索问题．利用动态规划的原理，将模型转化成一系列循环搜索过程，以求得最优搜索策略．并证明了最优ｕ．
A problem of discrete sequence serach with switch cost is studied .The principle of dynamic programming has been used to change the model into a series of cyclic search processes for the optimal strategy.The necessary and sufficient for the existence of optimal u.p . strategy has been improved.
出处
《西北建筑工程学院学报（自然科学版）》
1999年第3期69-71,84,共4页
Journal of Northwestern Institute of Architectural Engineering
关键词
转移费用
策略
最优搜索
离散序列
switch cost
ultimately periodic strategy
optimal search
discrete sequence
