搜索结果

内部信息网组织规划的优化模型 NP问题 希望对大家有用

时间表问题是NP完全的，因此很难寻求一个有效的整体优化算法，分组作为重要的油画策略

Capturing low-level network data can be hard in Java, but it s certainly not impossible If you want to capture network packets in your Java program, you ll need a little help because no parts of the core Java APIAPI give access to low-level network

背包问题是组合优化领域内经典的NP完备间题,本文介绍了pso解决0/1背包问题上的一个方法

应用遗传算法是被认为求解NP难题的有效手段之一,求解物流配送车辆路径优化问题时,在传统遗传算法的基础上,并引入了免疫算法的思想,实验结果表明该算法具有更好的全局和局部搜索能力和收敛速度,可有效地解决物流配送车辆路径优化问题。 ...

Writing this book was hard work, but also a lot of fun. Thanks to everyone who made it possible, especially Jinny Verdonck, Thomas Kraft, Ricky Nkrumah, Kirk Bateman, and the whole Apress crew. A big thanks goes also to the community that continuously extends and improves J2ME Polish!

These listed libraries are written in WTL. But it s really hard to mix both MFC & WTL together. Obviously, it s not reasonable to ask a developer or a team to giving up MFC and move to the WTL world just because there were some great controls or visual Frameworks written in WTL (there are many thing ...

蚁群优化算法是一种基于自然启发的metaheuristic算法,从其提出到现在历经10多年的发展到目前已经成为一种解决组合优化问题的有效工具。最大团问题是一个经典的NP难的组合优化问题,很多实际问题都可以抽象为对无向图上最大团问题的求解,所以,对最大团问题的研究无论在理论上还是实际上都有重要意义。 ...

利用NP问题中的标准遗传算法解决复杂函数最优最大值问题。程序可根据需要扩展。

随机粒子群算法对解答NP问题、复杂问题，具有传统算法难以比拟的优势——复杂性低，求得的解具有比较理想——当然，对待不同的问题，我们还需要进一步进行问题领域的编码！