登录
首页 » Visual C++ » KnapSack

KnapSack

于 2010-05-12 发布 文件大小:399KB
0 279
下载积分: 1 下载次数: 2

代码说明:

  Fractional knapsack problem, Greedy algorithm

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • C_classical_src
    平常练习的一些程序,比较基础,包括求斐波那契数、完数等等(Some of the usual practice procedures, more infrastructure, including seeking Fibonacci numbers, number, etc. End)
    2013-11-18 21:18:19下载
    积分:1
  • chebyshevnihe
    说明:  数值分析中的chebyshev拟合程序,学习数值分析的同学可以参考参考(Numerical Analysis of chebyshev fit program, students study and numerical analysis can refer to reference)
    2011-03-24 15:07:01下载
    积分:1
  • EMD-C
    EMD分解C语言算法,内含EMD分解所需的三次样条插值C语言算法。(EMD decomposition algorithm C language, containing the decomposition EMD cubic spline interpolation algorithm C language.)
    2021-02-03 01:10:00下载
    积分:1
  • theSecond
    这个程序分别用二分法,Newton法,弦截法,Newton下山法等算法求解非线性方程(this procedure were used dichotomy, Newton, String interception, Newton downhill law for solving nonlinear equations)
    2006-10-18 11:01:49下载
    积分:1
  • STKtest1
    说明:  C++调用STK 仿真软件的程序。可以实时进行场景仿真。(C++ simulation software program called STK. Scenarios can be simulated in real time.)
    2020-09-21 13:37:51下载
    积分:1
  • zjbhydm
    正交变换源程序,带vc工程。 学习正交变换算法的有力工具。(Orthogonal transformation source code, with vc works. Orthogonal transformation algorithm to learn a powerful tool.)
    2008-04-01 22:53:07下载
    积分:1
  • kemodel
    一个对Fluent中k-e湍流模型的修正udf程序,c语言(One pair ke turbulence model in Fluent udf amendment procedures)
    2021-01-02 15:38:57下载
    积分:1
  • newton
    牛顿插值算法,利用数组存储均差表,一步步迭代求得插值(Newton interpolation algorithm, the use of array stores are differential gauge, step by step, iterative get interpolation )
    2012-05-06 15:22:52下载
    积分:1
  • 源代码
    七段s曲线路径规划程序详解 非常适合做运动控制规划(Detailed solution of seven segment s curve path planning program)
    2018-02-01 09:38:46下载
    积分:1
  • shiyan4
    若矩阵A中的某一元素A[i,j]是第i行中的最小值,而又是第j列中的最大值,则称A[i,j]为矩阵A中的一个鞍点。请写出一个可确定此鞍点位置的算法(如果这个鞍点存在)。(If the matrix A, an element A [i, j] is the minimum value in the i-th row, but is the maximum value of the j-th column, then A [i, j] for the matrix A is a saddle point. Please write a algorithm to determine the position of saddle point (saddle point exists).)
    2013-01-07 13:16:11下载
    积分:1
  • 696516资源总数
  • 106769会员总数
  • 14今日下载