搜索资源列表
GoodsAllocatingProblemwithMultiAimsbasedonTheHybri
- 多目标货物配装问题是一个复杂的组合优化问题，属于NP难问题，本文用混合粒子群算法求解多目标货物配装问题。混合粒子群算法在基本粒子群算法的基础上，通过引进遗传算法中的交叉和变异的策略，避免了陷入局部最优，加快了达到全局最优的收敛速度。此外，本文提出用权重系数来平衡各目标使各目标都能达到相对较优的效果。-Multi-objective loading of goods is a complicated combinatorial optimization problems are NP hard p
NPC_Problem
- 经典NP-hard问题的描述以及到2003年为止问题被解决的程度-classic NP-hard problems
lect11-07
- A lecture on NP-hard optimization
Approximation_Algorithms_for_NP-Hard_Problems
- NP hard problems aproximation algorithm
CHUONG4
- Finding a vertex cover of minimum cardinality is NP-hard
Km
- In data mining, k-means clustering is a method of cluster analysis which aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean. This results in a partitioning of the data space into Vo
algorithms
- 算法导论英文版第二版；从简单的基本算法到难的贪心算法或NP难题；-Introduction to Algorithms, Second Edition English basic algorithms from simple to difficult greedy algorithms or NP-hard