內(nèi)部信息網(wǎng)組織規(guī)劃的優(yōu)化模型 NP問(wèn)題 希望對(duì)大家有用
標(biāo)簽： 信息網(wǎng) 優(yōu)化模型 家
上傳時(shí)間： 2015-12-11
上傳用戶：sy_jiadeyi
時(shí)間表問(wèn)題是NP完全的，因此很難尋求一個(gè)有效的整體優(yōu)化算法，分組作為重要的油畫策略
標(biāo)簽：
上傳時(shí)間： 2014-01-06
上傳用戶：youke111
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
標(biāo)簽： impossible Capturing low-level certainly
上傳時(shí)間： 2016-03-05
上傳用戶：yuanyuan123
背包問(wèn)題是組合優(yōu)化領(lǐng)域內(nèi)經(jīng)典的NP完備間題,本文介紹了pso解決0/1背包問(wèn)題上的一個(gè)方法
上傳時(shí)間： 2013-12-22
上傳用戶：familiarsmile
應(yīng)用遺傳算法是被認(rèn)為求解NP難題的有效手段之一,求解物流配送車輛路徑優(yōu)化問(wèn)題時(shí),在傳統(tǒng)遺傳算法的基礎(chǔ)上,并引入了免疫算法的思想,實(shí)驗(yàn)結(jié)果表明該算法具有更好的全局和局部搜索能力和收斂速度,可有效地解決物流配送車輛路徑優(yōu)化問(wèn)題。
標(biāo)簽： 算法 物流配送 免疫算法 實(shí)驗(yàn)結(jié)果
上傳時(shí)間： 2016-04-07
上傳用戶：gxf2016
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!
標(biāo)簽： everyone possible Writing Thanks
上傳時(shí)間： 2016-04-15
上傳用戶：Yukiseop
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 things that should be considered especially in a company with hundreds of developers like the company I work for). Unfortunately, there was no such good and free visual Framework in MFC until now. Whatever difficulties there are, I still desire to be able to use them and now my effort is here to be shared with you. Under the Hood
標(biāo)簽： libraries WTL together written
上傳時(shí)間： 2013-12-18
上傳用戶：wcl168881111111
蟻群優(yōu)化算法是一種基于自然啟發(fā)的metaheuristic算法,從其提出到現(xiàn)在歷經(jīng)10多年的發(fā)展到目前已經(jīng)成為一種解決組合優(yōu)化問(wèn)題的有效工具。最大團(tuán)問(wèn)題是一個(gè)經(jīng)典的NP難的組合優(yōu)化問(wèn)題,很多實(shí)際問(wèn)題都可以抽象為對(duì)無(wú)向圖上最大團(tuán)問(wèn)題的求解,所以,對(duì)最大團(tuán)問(wèn)題的研究無(wú)論在理論上還是實(shí)際上都有重要意義。
標(biāo)簽： metaheuristic 組合 優(yōu)化算法 算法
上傳時(shí)間： 2014-01-16
上傳用戶：ardager
利用NP問(wèn)題中的標(biāo)準(zhǔn)遺傳算法解決復(fù)雜函數(shù)最優(yōu)最大值問(wèn)題。程序可根據(jù)需要擴(kuò)展。
標(biāo)簽： 標(biāo)準(zhǔn) 函數(shù) 擴(kuò)展 算法
上傳時(shí)間： 2016-05-05
上傳用戶：1109003457
隨機(jī)粒子群算法對(duì)解答NP問(wèn)題、復(fù)雜問(wèn)題，具有傳統(tǒng)算法難以比擬的優(yōu)勢(shì)——復(fù)雜性低，求得的解具有比較理想——當(dāng)然，對(duì)待不同的問(wèn)題，我們還需要進(jìn)一步進(jìn)行問(wèn)題領(lǐng)域的編碼！
上傳時(shí)間： 2016-05-10
上傳用戶：bibirnovis
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
