登录
首页 » Others » 0-1

0-1

于 2020-05-04 发布
0 160
下载积分: 1 下载次数: 1

代码说明:

说明:  用LINGO求解最短路径问题,此方法为0-1规划,只适用于简单的ILP问题。(Lingo is used to solve the shortest path problem, which is a 0-1 programming method. It is only suitable for simple ILP problems.)

文件列表:

0-1.lg4, 5632 , 2020-05-03

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

发表评论


0 个回复

  • SVD
    最小二乘估值的SVD分解计算方法,本程序可将最小二乘估值问题转化为超定方程组的问题处理,且可用奇异值分解的方法计算最小二乘问题。(Least Squares Estimates of the SVD decomposition method, the valuation process can be transformed into squares overdetermined equations deal with the problem, and can be calculated singular value decomposition least squares problem.)
    2020-07-04 15:20:02下载
    积分:1
  • xitongbianshi
    通过最小二乘辨识系统模型,并进行必要的分析,是上系统辨识课的实验内容,有程序和报告(By least squares identification system model and the necessary analysis on System Identification lesson experimental content, procedures and reporting)
    2012-11-01 10:06:10下载
    积分:1
  • BZreaction_diffusion
    模拟二维BZ反应扩散模型,方法是用显式EULER法求解模型的偏微分方程组(Simulated two-dimensional BZ reaction-diffusion model, the method is to use explicit EULER method for solving partial differential equations model)
    2011-09-21 12:00:27下载
    积分:1
  • na7
    Orthogonal Polynomials Approximation 数值分析,计算正交基多项式的系数 (Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance. Format of function int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps ) where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial. Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)
    2011-11-27 11:47:21下载
    积分:1
  • LSHNR5
    三相潮流计算,使用的是牛顿拉弗逊方法。迭代较快。是解决潮流的较有效的方法。(Three-phase power flow calculation, using Newton' s method Laffer Johnson. Iterate rapidly. The trend is to solve the more effective method.)
    2013-10-29 23:32:56下载
    积分:1
  • Hypercomplexmathematicalmorphology
    Hypercomplex mathematical morphology
    2009-12-29 16:34:22下载
    积分:1
  • UKF
    无迹卡尔曼滤波算法的c语言。网上找到的,貌似是老外编的,蛮不错的。(unscented kalman filter code of visual c.)
    2021-01-05 15:08:54下载
    积分:1
  • Dieselengine
    一个柴油机模型,能计算柴油机的油耗率,扭矩(a diesel engine modle)
    2021-01-11 11:18:49下载
    积分:1
  • fortran
    圆柱绕流的数值模拟(基于有限体积法),Fortran程序(Numerical simulation of flow around a cylinder (based on the finite volume method), Fortran program)
    2009-11-21 18:21:30下载
    积分:1
  • Bayes-KNN
    基于贝叶斯-KNN文本分类算法的设计与实现。 是贝叶斯和KNN两种分类算法的结合。(Bayesian-KNN text categorization algorithm design and implementation. Bayes and KNN is a combination of two kinds of classification algorithms.)
    2011-08-01 11:36:31下载
    积分:1
  • 696518资源总数
  • 104824会员总数
  • 34今日下载