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.
標(biāo)簽： applications guaranteed carefully programs
上傳時(shí)間： 2015-12-20
上傳用戶：lanjisu111
圖著色問題的回溯算法，圖著色問題是一個(gè)NP-完全問題.
標(biāo)簽： 回溯算法
上傳時(shí)間： 2013-12-06
上傳用戶：qq21508895
算法設(shè)計(jì)與文件的整套電子教案，主要包括遞歸和分治方法、動(dòng)態(tài)規(guī)劃算法、貪心算法、回溯法、分支限界法等常用算法和NP問題
標(biāo)簽： 算法設(shè)計(jì) 電子教案
上傳時(shí)間： 2013-12-23
上傳用戶：baiom
旅行商問題是組合優(yōu)化的經(jīng)典問題，應(yīng)用廣泛，而且長期以來被作為NP-complete問題的理想研究平臺。文章介紹了旅行商問題的基礎(chǔ)知識、應(yīng)用，以及常用的求解方法。
上傳時(shí)間： 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
標(biāo)簽： responsibility Proceedings Interesting Algorithms
上傳時(shí)間： 2016-06-28
上傳用戶：wyc199288
貪心算法解決送貨員問題，使其走過的路線盡量減少，近似解求得NP問題的解。
標(biāo)簽： 算法
上傳時(shí)間： 2013-12-03
上傳用戶：zycidjl
啟發(fā)式遺傳算法在電子商務(wù)下物流配送中心選址中的研究. 電子商務(wù)環(huán)境下的物流配送中心選址問題比較復(fù)雜，涉及因素較多。根據(jù)物流配送特點(diǎn)，對配送中心選址模型的變動(dòng) 費(fèi)用和時(shí)間約束作修改，建立更加合理的適用于電子商務(wù)環(huán)境下的物流配送中心選址模型。由于選址模型屬于NP難問題，故采用啟 發(fā)式遺傳算法進(jìn)行求解。 [關(guān)鍵詞] 電子商務(wù) 啟發(fā)式遺傳算法 物流配送中心
標(biāo)簽： 電子商務(wù) 物流配送 啟發(fā)式 算法
上傳時(shí)間： 2014-11-22
上傳用戶：GHF
奇跡 mu 客戶端 main 97 b補(bǔ)丁，未跳np
上傳時(shí)間： 2016-10-16
上傳用戶：sxdtlqqjl
用于無約束優(yōu)化的鮑威爾優(yōu)化方法， 程序中參數(shù)解釋如下：//P:存放設(shè)計(jì)變量 //XI：存放兩個(gè)線性無關(guān)的向量 //N：含有N各元素的一維實(shí)型數(shù)組，用于存儲設(shè)計(jì)變量 //NP:整形變量，用于存儲P與xi的維數(shù) //FTOL：迭代精度 //FRET：輸出參數(shù)，存放目標(biāo)函數(shù)在找到的近似極小值點(diǎn)處的值 //ITER:迭代次數(shù)
標(biāo)簽：
上傳時(shí)間： 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
標(biāo)簽： combinatorial assignment problem arises
上傳時(shí)間： 2014-01-19
上傳用戶：BIBI
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
