knapsack algorithm 中文意思是什麼

knapsack algorithm 解釋
漸縮演算法, 背包演算法
  • knapsack : n. （軍用或旅行用）背包。
  • algorithm : n. 【數學】演算法；規則系統；演段。
  1. A study on knapsack problem by genetic algorithm

    遺傳演算法在求解背包問題中的應用
  2. Solve knapsack problem by semi - feasible genetic algorithm

    背包問題的遺傳演算法求解
  3. A hybrid genetic algorithm for solving 0 - 1 knapsack problem

    1背包問題的混合遺傳演算法
  4. Nonlinear reductive dimension approximate algorithm for 0 - 1 knapsack problem

    1背包問題的非線性降維近似演算法
  5. Heuristics algorithm for knapsack problem based on the tabu search

    基於禁忌搜索的啟發式求解背包問題演算法
  6. By making use of simulated annealing algorithm with memory, and determining a set of effective cooling schedule, the thesis solves this complex and special knapsack problem successfully

    本文應用帶記憶功能的模擬退火演算法，結合理論分析和經驗法則，通過大量試驗確定了一組有效的冷卻進度表參數，成功地解決了這個復雜而特殊的背包問題。
  7. A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed, in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique

    摘要構造出了一類可分離非線性0 - 1背包問題的分枝定界演算法，分枝的過程是普通的0 - 1變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。
  8. Aimed at the 0 - 1 knapsack problems, the article proposes a kind of hybrid intelligence algorithm combining with the adjusting strategy, the greedy algorithm and the binary particle swarm optimization algorithm

    摘要針對0 - 1背包問題，提出一種具有修復策略的、貪心演算法與二進制粒子群演算法相結合的混合智能演算法。
  9. A kind of hybrid particle swarm optimization algorithm for solving 0 - 1 knapsack problems

    1背包問題的混合粒子群演算法
  10. Proposing the multilevel indexing structure and algorithm that can effectively handle the huge user - profile files, and adopts the model of knapsack problem to solve the problem for providing suitable volume of information to users

    提出了可以高效處理大量user - profile文件的多級索引結構及演算法，用背包問題模型來解決給用戶提供恰當數量信息的問題。
  11. A coevolutionary genetic algorithm for 0 - 1 knapsack - problem

    1背包問題的共同進化遺傳演算法
  12. Genetic algorithm for multi knapsack problem

    多背包問題的遺傳演算法求解
  13. Ant colony algorithm for 0 1 knapsack problem

    1背包問題的蟻群方法
  14. The proposed algorithm for knapsack problem is based on mimd. the sort algorithm by sampling is introduced in the sorting stage. the stages of generating subset - sum and searching are also optimized

    并行背包演算法基於mimd結構，在排序過程中引入基於采樣的排序演算法，然後對子集和生成和搜索過程加以優化。
  15. After the existing algorithms for knapsack problem and selecting the base point of ecc over gf ( p ) are deeply analyzed, a parallel algorithm for knapsack problem and that of selecting the base point of ecc are respectively proposed

    在深入分析背包問題的現有并行演算法和gf （ p ）上ecc的基點選取演算法性能的基礎上，分別提出一種基於采樣和mimd結構的背包問題并行演算法和gf （ p ）上ecc的并行基點選取演算法。
  16. Then, the cutting - stock technology in the product design system oriented to the optimized utilization of material resource is deeply studied. in this paper, the mathematics model of two - dimensional guillotine cutting - stock problem based on inventory is set up. to solve the mathematics model above, the iterative solving method through wiping off worse layout is put forward ; on the base of the column generation formulas that are deduced to solve multi - material two - dimensional guillotine cutting - stock model ， the column generation algorithm is brought forward by using column generation technology ; the solution of two - dimensional knapsack problem and one - dimensional knapsack problem is studied ; the concept of the value of

    給出了基於庫存的二維guillotine優化下料問題的數學模型，提出了一種新的求解方法? ?去差迭代求解法；引入了列生成技術，在推導多原材二維guillotine優化下料模型求解的列生成數學形式的基礎上，給出了列生成迭代求解演算法，研究並分析了二維背包問題和一維背包問題的求解演算法；提出了板材排樣價值概念，建立了板材排樣價值的估計方法；論文同時針對優化下料技術當前應用中存在的問題，提出了一種基於asp （ applicationservicesprovider ）模式的多軟體協同優化下料解決方法並給出了該方法基於agent思想的具體實現技術。
分享友人
分享到 Line

分享到臉書