Search - knapsack

Search - knapsack - List

【Mathimatics-Numerical algorithms】 knapsack.rar DL : 0: 用GAlib库实现的解决0/1背包问题的遗传算法程序源代码。
Update : 2024-05-18 Size : 3090 Publisher :
【Mathimatics-Numerical algorithms】背包问题 DL : 0: 经典算法之背包问题-classic algorithms knapsack problem
Update : 2008-10-13 Size : 2194 Publisher : 常乐
【PropertySheet】 thesis2000_fangqi DL : 0: 算法分析和设计的主要原理,动态规划贪心算法背包问题的实例-algorithm analysis and design of the main principle of dynamic programming greedy algorithm examples knapsack problem
Update : 2008-10-13 Size : 69562 Publisher : 望水
【Other】贪心方法 DL : 0: 贪心方法解0/1背包问题,构造一个物品类,调用类方法对背包进行排序,核心代码已给出-greedy method for 0 / 1 knapsack problem, a structural categories of goods, the category called right backpack method for sequencing, the core code has been given
Update : 2008-10-13 Size : 52052 Publisher : 赵立
【Mathimatics-Numerical algorithms】 my0-1knapsack DL : 0: 给定n 个物品, 物品i重为wi 并且价值为 vi ，背包所能承载的最大容量为 W. 0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W ．用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum total value of the goods but a subset of the W capacity. Dynamic Programming
Update : 2008-10-13 Size : 1002 Publisher : 叶黎
【Other resource】背包算法 DL : 0: 高级算法中的背包问题求解，算法简便高效，主要解决动态规划0-1背包问题-senior algorithm to solve the knapsack problem, the algorithm is simple and efficient, dynamic programming solution 0-1 knapsack problem
Update : 2008-10-13 Size : 8788 Publisher : 李亚伟
【Other】 Multiobjective-Knapsack-Problem DL : 0: Multiobjective Knapsack Problem
Update : 2024-05-18 Size : 4096 Publisher : alex
【Other】 floyd-knapsack DL : 0: floyd knapsack Floyd-Warshall算法（Floyd-Warshall algorithm）是解决任意两点间的最短路径的一种算法，可以正确处理有向图或负权的最短路径问题，同时也被用于计算有向图的传递闭包。Floyd-Warshall算法的时间复杂度为O(N3)，空间复杂度为O(N2)。背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。问题的名称来源于如何选择最合适的物品放置于给定背包中。-floyd knapsack Floyd-Warshall algorithm (Floyd-Warshall algorithm) is an algorithm to solve the shortest path between any two points can correctly handle have the shortest path to the map or negative weights, but also be used to calculate the transitive closure of a directed graph package. Floyd-Warshall time complexity of the algorithm is O (N3), space complexity is O (N2). Knapsack problem (Knapsack problem) is NP-complete optimization of a composition. The problem can be described as follows: given a set of items, each item has its own weight and price, for a limited total weight, how we choose to make the total price of the most goods. The name comes the question of how to choose the most suitable place objects in a given backpack.
Update : 2024-05-18 Size : 2048 Publisher : 贺敏
【Windows Develop】 0-1-knapsack-problem DL : 0: 动态规划解决01背包问题,采用c语言实现-01 dynamic programming to solve the knapsack problem, with c language
Update : 2024-05-18 Size : 1024 Publisher : 俞溯
【Other systems】 knapsack DL : 0: The zip file contain a program on solving knapsack problem using genetic algorithm.
Update : 2024-05-18 Size : 7168 Publisher : Goodboy
【Other】 knapsack-problem DL : 0: 背包问题即给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。-A hybrid algorithm combining ant colony system with multi-choice Knapsack problem was proposed.
Update : 2024-05-18 Size : 1024 Publisher : 刘芳
【Windows Develop】 ACO-knapsack DL : 0: Ant colony optimization matlab code for solving Knapsack problem
Update : 2024-05-18 Size : 14336 Publisher : javad
【Energy industry】 GA-knapsack DL : 0: Post codes, solve GA-knapsack with the help of genetic algorithms using MATLAB software.-Post codes, solve GA-knapsack with the help of genetic algorithms using MATLAB software.
Update : 2024-05-18 Size : 3072 Publisher : mahya
【File Format】 knapsack DL : 0: Development of a heuristic for the Knapsack problem
Update : 2024-05-18 Size : 709632 Publisher : kakaw
【Other】 knapsack DL : 0: Knapsack optimization algorithm in python
Update : 2024-05-18 Size : 1024 Publisher : javadi
【Data structs】 knapsack DL : 0: 背包算法的非递归实现，使用进出栈进行操作(Non-recursive implementation of knapsack algorithm)
Update : 2024-05-18 Size : 25600 Publisher : 白帝
【】 knapsack_GA DL : 0: visual c++背包问题遗传算法求解，含注释(visual C++ knapsack problem genetic algorithm solution, containing annotation)
Update : 2024-05-18 Size : 286720 Publisher : zj992
【Other】 knapsack problem DL : 0: 用动态规划解决01背包问题，以及回溯找到最终解，完美的解决了动态规划的思想(Use dynamic programming to solve the 01 knapsack problem.)
Update : 2024-05-18 Size : 3840000 Publisher : 莫忘莫失
【android】 java knapsack DL : 0: knapsack problem Backpack problem in Java.
Update : 2021-06-04 Size : 564 Publisher : 3099372860@qq.com
【CloudComputing】 java knapsack zi DL : 0: A subset java knapsack zi
Update : 2021-06-04 Size : 1094 Publisher : 3099372860@qq.com

« 1 2 ... 10 11 12 13 14 1516 17 18 19 20 ... 50 »