This paper presents a new method to draw the covering line in solving assignment problems.
本文提出了一种在求解指派问题的匈牙利法中如何划最少覆盖线的方法。
A new approach is proposed to solve assignment problems with linguistic assessment information.
针对解决具有语言评价信息的多目标指派问题，提出了一种新的求解方法。
We present a new algorithm for non-equilibrium traffic assignment problems based on the dynamic generating of the shortest paths between every O-D pair.
提出了基于最短路动态生成的一种新的非平衡交通分配迭代算法。
We present a new algorithm for non-equilibrium traffic assignment problems based on the dynamic generating of the shortest paths between every O-D pair.
提出了基于最短路动态生成的一种新的非平衡交通分配迭代算法。
应用推荐