搜索资源列表
show
- 背包算法的图形图像表示，算法数据被写死在程序中，当更换数据时，需要自已修改-Knapsack Algorithm graphic image representation, algorithms, data is written dead in the program, when the replacement of the data, you need to modify their own
Gbag
- 利用图的深度便利解决背包算法,稍稍改动可以输出各种方案-Facilitate the use of the depth chart to solve knapsack algorithm can slightly change the output of various programs
MNTH
- 在管理科学、计算机科学、分子物理学、生物学、超大规模集成电路设计、代码设计、图像处理和电子工程等领域中，存在着大量的组合优化问题。例如，货郎担问题、最大截问题、0—1背包问题、图着色问题、设备布局问题以及布线问题等，这些问题至今仍未找到多项式时间算法。-In management science, computer science, molecular physics, biology, VLSI design, code design, image processing and electro
the.01.Knapsack.Problem-
- 遗传算法求解01背包问题，代码、文档都有-01 knapsack problem genetic algorithm, code, documentation has
0_1bag100
- 0 1背包问题的C＋＋实现代码，比较简单，希望大家可以借鉴。-0 1 knapsack problem realize the C code is relatively simple, I hope everyone can learn from.
plecak1
- algorithm to solve knapsack problem