The paper discusses a nonregular cost function and its optimum criterion, presenting an algorithm of constructing and optimal alphabetic binary tree under this criterion.
本文讨论一种非正则的评价函数和它的最优化的一种准则，给出在这种准则下构造按字典次序的最优二元树的一种算法。
Taking minimizing annual operating cost as an object function, the method employed hereditary algorithm to get optimal compensatory places (non-node) and capacity.
该算法以年运行费用最小为目标函数，运用遗传算法求出最佳的补偿地点(非节点)和最优补偿容量。
Constructing a simple network and converting the allocation problem into the min-cost max-flow in the network, we have developed an optimal algorithm for the allocation problem.
我们构造了一个简单网络，将布点问题转化为该网络中的最小费用最大流问题，从而给出了求解布点问题的最优性算法。
应用推荐