1) absent assignment problem of least cost subjecting to the shortest time limit
最短时限最少耗费缺省指派问题
1.
Based on deep research of the absent assignment problem of least cost subjecting to the shortest time limit presented firstly in document [1] in 1998 , in view of symmetry this paper has given the absent assignment problem two different ways to ask the question as follows .
在研究周良泽于1998年首先提出的最短时限最少耗费缺省指派问题基础上,从对称的角度给出了缺省指派问题的两种不同提法:拟从m个人中派出β个人去干n件事中的β件事(β≤min{m,n},每件事由一个人完成)。
2) absent assignment problem of the shortest time limit subjecting to least cost
最少耗费最短时限缺省指派问题
3) shortest-time transportation problem
最短时限运输问题
1.
This paper investigates an unbalanced production-marketing shortest-time transportation problem.
研究产量大于销量的产销不平衡最短时限运输问题。
4) the least cost
最少耗费
1.
Provide a method to solve the assignment problem with the shortest time limit and the least cost constraint in two steps.
对最短时限最少耗费指派问题分两步求解,第一步使用最大优先指派算法(MSFA)结合二分图匹配快速求解最短时限值;第二步在已求得的最短时限下,构造带权二分图,使用最小带权二分图指派算法求解,得到最短时限下的最少耗费指派解。
5) least time consuming
耗时最少
1.
In view of the passengers’ traveling psychology, an optimal route algorithm of the city public transportation, which takes the least transfer and the least time consuming as constraint conditions, was designed.
本文充分考虑了乘客出行心理后,设计了以换乘次数最少和出行耗时最少作为约束目标的公交出行最优路径算法。
6) the shortest time limit
最短时限
1.
Provide a method to solve the assignment problem with the shortest time limit and the least cost constraint in two steps.
对最短时限最少耗费指派问题分两步求解,第一步使用最大优先指派算法(MSFA)结合二分图匹配快速求解最短时限值;第二步在已求得的最短时限下,构造带权二分图,使用最小带权二分图指派算法求解,得到最短时限下的最少耗费指派解。
2.
The absent assignment problem to the shortest time limit which is given by Zhou Lingze in 1998 has been transformed to the minimum weighted k matching problem in bipartite graph with weight.
将周良泽在 1998年提出的最短时限缺省指派问题转化成赋权二分图的最小权 K-匹配问题。
3.
Transportation prblem to the shortest time limit is put forward.
提出了最短时限运输问题,借助于赋权二分图研究了其解的最优性充要条件,并给出了在赋权二分图上求解的具体步骤,最后给出了一个实例。
补充资料：缺吃短穿
1.见"缺吃少穿"。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条