组合最优化问题 meaning in Chinese

combinatorial optimization problem
combinatorial problem

Three - dimensional component packing is a combinatorial optimization and np - complete problem . it is difficult to find its exact global optimum
三维布局问题属于组合最优化问题和np完全问题，在一定时间内求其精确全局最优解是相当困难的。
Three - dimensional packing ( tdp ) is a combinatorial optimization and hp - complete problem and applied widely to the mechanical manufacture and traffic transportation industries . up to now there are varieties of heuristic algorithms to solve the tdp because of its high complication , we discuss the heuristic algorithm deeply in this paper and apply the simulated annealing ( sa ) algorithm to the packing system
三维布局问题属于组合最优化问题和np完全问题，具有高度复杂性，用一般的数学方法根本无法求解，目前解决三维布局问题多为各种启发式方法，本文在对启发式方法进行深入探讨的基础上，采用了用于解决一般三维布局问题的模拟退火算法作为布局系统的操作算法。