理学 算法设计 释 greedy algorithm 贪心法 优化问题的算法通常由一系列步骤组成，每一步包含一个选择集合。贪心法总是作当时看起来最好的选择，也就是说，它每一步作一个局部最优的选择以期这个选择最终导致一个全局的最优解。
＞运筹学＞组合优化＞释义 greedy algorithm 贪婪算法 greedy algorithm 贪婪算法†
理论计算机科学 算法设计与分析 释文 greedy algorithm 贪婪算法 理论计算机科学 算法设计与分析 释文 greedy algorithm 贪婪算法
- concentration class
- concentration coefficient
- concentration compactness lemma I
- concentration compactness lemma II
- concentration compactness lemma Ⅱ
- concentration compactness principle
- concentration-compactness principle
- concentration constant
- concentration control coefficient
- concentration control coefficients，CCCs
- concentration control of pollutant
- concentration criterion of ore
- concentration cylinder
- concentration-dependent antibiotics
- concentration-dependent antimicrobial agents
- concentration direct reading
- concentration ellipse
- concentration equipment
- concentration factor
- concentration for 50% of maximal effect
- concentration function
- concentration gradient field
- concentration index
- concentration in situ
- concentration interval