带固定费用的运输问题是一类NP难题，没有多项式算法可以求解。
The transport problem with fixed charge is a kind of NP problem, and there is no polynomial algorithm which can solve it.
研究资助者提出的策略，是把出版费用视为研究费用的固定项目，有效地纾解此问题。
The strategy of those funding research to accept publishing costs as a fixed item of research expenditure mitigates this problem.
在加工时间可压缩的排序问题中，工件的加工时间参数是不固定的，因此我们可以压缩工件原始的加工时间，产生压缩费用。
In the controllable processing time problems, time parameters of jobs may not be fixed, so we can compress the original processing time, and reduce the corresponding pressure cost.
应用推荐