... 组合最优化问题：combinatorial optimization problem 组合维数：combinatorial dimension 组合拓朴学：combinatorial topology ...
双语例句
1
Three dimension packing problem with multi constraints is a complicated combinatorial optimization, and is NP HARD problem. It is difficult to obtain on optimal solution.
多约束条件下的三维装箱问题是一个复杂的组合优化问题，属于NP- HARD问题，其求解是很困难的。
2
Distribution network planning is generally a high dimension and nonlinear combinatorial optimization problem.
配电网规划模型具有非线性、高雏数的特点，属于复杂组合优化问题。
3
As a combinatorial optimization problem, three dimension packing problem with multi-constraints is NP-HARD problem. It is very difficult to obtain an optimal solution.