1) minimum price flux problem
最小代价流问题
2) min-cost flow problem
最小费用流问题
1.
We first construct an auxiliary network and convert the min-cost flow problem in origial network into the min-cost circulation problem in the auxilary network,and then find the optimal solution of min-cost circulation problem in the auxiliary network by using out-of-kiltem algo.
讨论在总流量可变动的情况下 ,网络最小费用流问题的解法。
3) maximum cost minimum flow
最小费用最大流问题
4) minimum cost circulation flow problem
最小费用循环流问题
6) Least element problem
最小元问题
1.
The relations of the vector F-complementarity problems, general vector variational inequalities, and least element problems of feasible set are given under certain conditions.
本文引入几类向量F-互补问题，并在一定条件下给出了向量F-互补问题，广义向量变分不等式以及可行集的最小元问题之间的相互关系。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条