理学 算法设计 释 greedy algorithm 贪心法 优化问题的算法通常由一系列步骤组成，每一步包含一个选择集合。贪心法总是作当时看起来最好的选择，也就是说，它每一步作一个局部最优的选择以期这个选择最终导致一个全局的最优解。
＞运筹学＞组合优化＞释义 greedy algorithm 贪婪算法 greedy algorithm 贪婪算法†
理论计算机科学 算法设计与分析 释文 greedy algorithm 贪婪算法 理论计算机科学 算法设计与分析 释文 greedy algorithm 贪婪算法
- bound occurrence
- bound of convergence
- bound of star-likeness
- bound of the error
- bound of uniqueness
- bound on effective properties
- bound orbit
- bound osculating space
- boundpair
- bound rotation
- Bound Slave
- bound state
- bound state as pole of Green's function
- bound tariff rate
- bound term
- bound variable
- bound vector
- bound volume
- Bound Volume of Spring and Autumn Annals and Zuo's Commentary, block-printed edition by Family Yue's private school in Jingxi County, Yuan Dynasty
- bound vortex
- bound water
- bound wave
- Bounseun Songmany
- Bouquet
- bouquet