Develops cutting plane methods, integral basis methods, enumerative and heuristic methods and approximation algorithms.
阐述割平面方法、整基方法、枚举和启发式方法和逼近算法。
Based on extensive researches on various heuristic methods, an objective-based heuristic algorithm was developed to solve the 2d rectangle packing problem.
为解决二维矩形布局问题，在广泛研究各种启发式方法的基础上，提出了基于目标的启发式算法。
Feature weighting is one of the important problems for feature weighting based KNN algorithm, and many heuristic methods have been employed to solve the problem traditionally.
特征权重学习是基于特征赋权的K近邻算法需要解决的重要问题之一，传统上提出了许多启发式的学习方法。
For satisfying the requirements of the time and space, it is reasonable and natural to compute certain sub-optimal feasible solution, and heuristic methods are designed based on such an idea.
为了满足求解此问题的时间、空间要求，寻找某个次优的、可有效计算的可行解成为自然而合理的办法。启发式方法就是基于这一思想所设计出的。
Task scheduling problem has been proved to be a NP-complete problem in the most of situations, which make heuristic methods to be widely used in the research of scheduling problem.
绝大部分情况下的任务调度问题已经被证明为NP完全问题，这使得启发式方法在调度中得到了普遍运用。
Task scheduling problem has been proved to be a NP-complete problem in the most of situations, which make heuristic methods to be widely used in the research of scheduling problem.
绝大部分情况下的任务调度问题已经被证明为NP完全问题，这使得启发式方法在调度中得到了普遍运用。
应用推荐