7,129
个编辑
更改
跳到导航
跳到搜索
第223行：
第223行： − + 第230行：
第230行： −
→集合问题 Set problem
*[[划分问题 Partition problem]] (SPP)<ref>V Maniezzo and M Milandri, "[https://link.springer.com/chapter/10.1007/3-540-45724-0_19 An ant-based framework for very strongly constrained problems]," Proceedings of ANTS2000, pp.222-227, 2002.</ref>
*[[划分问题 Partition problem]] (SPP)<ref>V Maniezzo and M Milandri, "[https://link.springer.com/chapter/10.1007/3-540-45724-0_19 An ant-based framework for very strongly constrained problems]," Proceedings of ANTS2000, pp.222-227, 2002.</ref>
*权约束的图树划分问题 Weight constrained graph tree partition problem (WCGTPP)<ref>R. Cordone and F. Maffioli,"[ftp://nozdr.ru/biblio/kolxo3/Cs/CsLn/A/Applications%20of%20Evolutionary%20Computing,%20EvoWorkshops%202001..%20EvoCOP(LNCS2037,%20Springer,%202001)(ISBN%203540419209)(529s)_CsLn_.pdf#page=74 Colored Ant System and local search to design local telecommunication networks]{{Dead link|date=June 2020 |bot=InternetArchiveBot |fix-attempted=yes }}," Applications of Evolutionary Computing: Proceedings of Evo Workshops, vol.2037, pp.60-69, 2001.</ref>
*权约束的图树划分问题 Weight constrained graph tree partition problem (WCGTPP)<ref>R. Cordone and F. Maffioli,"[ftp://nozdr.ru/biblio/kolxo3/Cs/CsLn/A/Applications%20of%20Evolutionary%20Computing,%20EvoWorkshops%202001..%20EvoCOP(LNCS2037,%20Springer,%202001)(ISBN%203540419209)(529s)_CsLn_.pdf#page=74 Colored Ant System and local search to design local telecommunication networks]," Applications of Evolutionary Computing: Proceedings of Evo Workshops, vol.2037, pp.60-69, 2001.</ref>
*弧加权的l-基数树问题 Arc-weighted l-cardinality tree problem (AWlCTP)<ref>C. Blum and M.J. Blesa, "[https://upcommons.upc.edu/bitstream/handle/2117/97393/R03-1.ps Metaheuristics for the edge-weighted k-cardinality tree problem]," Technical Report TR/IRIDIA/2003-02, IRIDIA, 2003.</ref>
*弧加权的l-基数树问题 Arc-weighted l-cardinality tree problem (AWlCTP)<ref>C. Blum and M.J. Blesa, "[https://upcommons.upc.edu/bitstream/handle/2117/97393/R03-1.ps Metaheuristics for the edge-weighted k-cardinality tree problem]," Technical Report TR/IRIDIA/2003-02, IRIDIA, 2003.</ref>
*最大独立集问题 Maximum independent set problem (MIS)<ref>G. Leguizamon, Z. Michalewicz and Martin Schutz, "[http://sedici.unlp.edu.ar/bitstream/handle/10915/23384/Documento_completo.pdf?sequence=1 An ant system for the maximum independent set problem]," Proceedings of the 2001 Argentinian Congress on Computer Science, vol.2, pp.1027-1040, 2001.</ref>
*最大独立集问题 Maximum independent set problem (MIS)<ref>G. Leguizamon, Z. Michalewicz and Martin Schutz, "[http://sedici.unlp.edu.ar/bitstream/handle/10915/23384/Documento_completo.pdf?sequence=1 An ant system for the maximum independent set problem]," Proceedings of the 2001 Argentinian Congress on Computer Science, vol.2, pp.1027-1040, 2001.</ref>
===纳米电子学物理设计中的器件尺寸问题 Device sizing problem in nanoelectronics physical design===
===纳米电子学物理设计中的器件尺寸问题 Device sizing problem in nanoelectronics physical design===