combinatorial dimension

基本解釋

Distribution network planning is generally a high dimension and nonlinear combinatorial optimization problem.
配電網(wǎng)規(guī)劃模型具有非線性、高雛數(shù)的特點，屬于復(fù)雜組合優(yōu)化問題。
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.
作為一類組合優(yōu)化問題，多約束條件下的三維裝載問題屬于NP-Hard問題，其求解也是相當(dāng)困難的。
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.
多約束條件下的三維裝箱問題是一個復(fù)雜的組合優(yōu)化問題，屬于NP- HARD問題，其求解是很困難的。