The programs and applications on this disk have been carefully tested, but are not guaranteed for any particular purpose. The publisher does not offer any warranties and does not guarantee the accuracy, adequacy, or completeness of any information and is not responsible for any errors or omissions or the results obtained from use of such information.
标签： applications guaranteed carefully programs
上传时间： 2015-12-20
上传用户：lanjisu111
图着色问题的回溯算法，图着色问题是一个NP-完全问题.
标签： 回溯算法
上传时间： 2013-12-06
上传用户：qq21508895
算法设计与文件的整套电子教案，主要包括递归和分治方法、动态规划算法、贪心算法、回溯法、分支限界法等常用算法和NP问题
上传时间： 2013-12-23
上传用户：baiom
旅行商问题是组合优化的经典问题，应用广泛，而且长期以来被作为NP-complete问题的理想研究平台。文章介绍了旅行商问题的基础知识、应用，以及常用的求解方法。
上传时间： 2016-05-21
上传用户：dengzb84
Proceedings of Practice of Interesting Algorithms 2007 The editor assumes no responsibility for the accuracy, completeness or usefulness of the information disclosed in this volume. Unauthorized use might infringe on privately owned patents of publication right. Please contact the individual authors for permission to reprint or otherwise use information from their papers. First edition 2007 Publication Planned by Prof. Wenxin Li Edited by Yili Zhao All rights reserved by Artificial Intelligence Laboratory, Peking University June 26, 2007
标签： responsibility Proceedings Interesting Algorithms
上传时间： 2016-06-28
上传用户：wyc199288
贪心算法解决送货员问题，使其走过的路线尽量减少，近似解求得NP问题的解。
标签： 算法
上传时间： 2013-12-03
上传用户：zycidjl
启发式遗传算法在电子商务下物流配送中心选址中的研究. 电子商务环境下的物流配送中心选址问题比较复杂，涉及因素较多。根据物流配送特点，对配送中心选址模型的变动 费用和时间约束作修改，建立更加合理的适用于电子商务环境下的物流配送中心选址模型。由于选址模型属于NP难问题，故采用启 发式遗传算法进行求解。 [关键词] 电子商务 启发式遗传算法 物流配送中心
上传时间： 2014-11-22
上传用户：GHF
奇迹 mu 客户端 main 97 b补丁，未跳np
上传时间： 2016-10-16
上传用户：sxdtlqqjl
用于无约束优化的鲍威尔优化方法， 程序中参数解释如下：//P:存放设计变量 //XI：存放两个线性无关的向量 //N：含有N各元素的一维实型数组，用于存储设计变量 //NP:整形变量，用于存储P与xi的维数 //FTOL：迭代精度 //FRET：输出参数，存放目标函数在找到的近似极小值点处的值 //ITER:迭代次数
标签：
上传时间： 2016-12-06
上传用户：1109003457
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
标签： combinatorial assignment problem arises
上传时间： 2014-01-19
上传用户：BIBI
