The maximum flow problem is one of the classical combinatorial optimization problems.
最大流问题是一个经典的组合优化问题。
The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.
最大团问题是组合优化中的一个经典的NP -完全问题。
Scheduling is an important combinatorial optimization problem. The modern scheduling problems that break through the various assumptions of the classical ones hold out more and more broad prospects.
排序问题是一类重要的组合优化问题，现代排序问题突破了经典排序问题的种种假设，有着越来越广阔的应用前景。
应用推荐