组合最优化问题的英文

• combinatorial optimization problem
• combinatorial problem

• "组合"英文翻译    make up; compose; constitute
• "最"英文翻译    most; best; worst; first; ve ...
• "优化"英文翻译    optimize; majorization; opti ...
• "问题"英文翻译    question; problem
• "组合最优化" 英文翻译 :    combinatorial optimization
• "最优化问题" 英文翻译 :    optimalization problem; optimization problem
• "次最优化问题" 英文翻译 :    secondary optimization problem
• "营销组合最优化" 英文翻译 :    marketing-mix optimization
• "多维最优化问题" 英文翻译 :    multidimensional optimization problem
• "静态最优化问题" 英文翻译 :    static optimization problem
• "离散型最优化问题" 英文翻译 :    discrete optimization problem; discreteoptimizationproblem
• "离散最优化问题" 英文翻译 :    discrete optimization problem
• "线性最优化问题" 英文翻译 :    linear optimization problem
• "自由最优化问题" 英文翻译 :    free optimization problem
• "整数规划与组合最优化" 英文翻译 :    integer program combination optimization
• "优化问题" 英文翻译 :    optimization problem
• "最优化问题的强适定性及其相关问题" 英文翻译 :    strong well-posedness in constrained optimization and related problems
• "多目标最优化问题的约束品性" 英文翻译 :    constrain qualifications about multiobject optimal programming
• "最优化" 英文翻译 :    opotimization; optimiization; optimization (mathematics); optimize; optimum theory
• "度量化问题" 英文翻译 :    metrization problem
• "跨文化问题" 英文翻译 :    cross-cultural issue
• "老化问题" 英文翻译 :    problem of aging
• "老龄化问题" 英文翻译 :    aging problem
• "最大化问题" 英文翻译 :    maximization problems
• "最佳化问题" 英文翻译 :    optimization 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完全问题，具有高度复杂性，用一般的数学方法根本无法求解，目前解决三维布局问题多为各种启发式方法，本文在对启发式方法进行深入探讨的基础上，采用了用于解决一般三维布局问题的模拟退火算法作为布局系统的操作算法。

• 组合最优化问题的日语：くみあわせさいてきかもんだい