在层次图边交叉最小化问题上，常规启发算法或者时间复杂度大或者布图效果不佳。

On the issue of crossing minimization, either time complexity or result of the conventional heuristic algorithm is unsatisfactory.

youdao

最小化边交叉数是层次图绘制过程中的一个关键步骤，直接影响着层次图的可读性。

Minimizing edge crossing is a key problem in drawing layered digraphs, and it's directly involved with the readability of the graph.

youdao

例如，在生产量被限定但能有效地使交叉污染最小化或使产量最大化时，多产品隔离室的初始资金总额。

For example, the initial capital investment for a multi-product isolator when throughput is limited, but which is effective at minimizing cross-contamination or maximizing yield.

youdao