机译:嵌入复杂度和离散优化II:Steiner-Tree问题的动态规划方法
Institute of Mathematics and Computer Science University of Greifswald 17487 Greifswald Germany cieslik@mail.uni-greifswald.de;
FSPM-Strukturbildungsprozesse University of Bielefeld 33501 Bielefeld Germany dress@mathematik.uni-bielefeld.de;
Department of Biometry and Informatics Swedish University of Agricultural Sciences 75007 Uppsala Sweden katharina.huber@bi.slu.se;
Linnaeus Center for Bioinformatics Uppsala University BMC Box 598 75124 Uppsala Sweden vincent.moulton@lcb.uu.se;
Mathematics Subject Classification2000: 90C39; 05C05; 68W99¶Key words and phrases: Optimization; discrete optimization; Divide and Conquer; dynamic programming; dynamic-programming schemes; computational complexity; algorithmic complexity; structural complexity; embedding complexity; treewidth; Steiner's problem; Steiner minimal trees; SMT;
机译:嵌入复杂度和离散优化II:Steiner-Tree问题的动态规划方法
机译:嵌入复杂度和离散优化I:离散优化的新的分而治之方法
机译:嵌入复杂度和离散优化I:离散优化的新的分而治之方法
机译:一种低复杂性多幸存动态规划,用于约束离散优化
机译:一种用于分析离散优化问题复杂性的局部搜索算法。
机译:通过将废铁/锰氧化物异位嵌入壳聚糖基质中作为有效的As(III)和As(V)吸附剂来优化杂化聚合物的制备
机译:一种低复杂性多幸存动态规划,用于约束离散优化