登录
首页 » C# » Ipopt-3

Ipopt-3

于 2015-01-07 发布 文件大小:3148KB
0 161
下载积分: 1 下载次数: 22

代码说明:

  MATLAB程序。无线传感器节点的定位。(Location of a wireless sensor node)

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

发表评论

0 个回复

  • UpdatedAddedFiles
    this is a algoritham about using GPS receicers
    2009-04-12 02:06:22下载
    积分:1
  • matlab
    matlab的各种mdl源代码,经典例题(example for matlab)
    2012-06-30 12:29:55下载
    积分:1
  • rozwi_zania
    fibonacci - algorytm matlab(fibonacci- algorytm matlab)
    2009-05-03 00:37:57下载
    积分:1
  • SC
    说明:  运用matlab编写变分不等式程序求解供应链网络问题。(Matlab prepared using procedures for solving variational inequalities supply chain network problems.)
    2021-03-16 20:39:22下载
    积分:1
  • hatchfillpkg
    In MATLAB, there are many functions that create regions filled with solid colors (e.g. contourf, area, bar).
    2011-09-09 17:11:03下载
    积分:1
  • 802.11b-11g-WLAN-channel-model
    This section of MATLAB source code covers 802.11b, 11g Channel Models used for hyperlan2 and other WLAN environment. These channel models are used for residential, office and commercial purposes.
    2014-12-02 14:42:36下载
    积分:1
  • 分支定界法
    说明:  分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1] 通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
    2021-04-26 12:21:14下载
    积分:1
  • Butterworthlowpass
    matlab实现Butterworthlow低通滤波器仿真程序(matlab achieve Butterworthlow low-pass filter simulation program)
    2007-12-26 12:39:25下载
    积分:1
  • M
    说明:  基于模板匹配的车牌自动识别系统的设计源代码(Based on template matching license plate recognition system design source code)
    2014-11-27 18:12:28下载
    积分:1
  • 遗传算法二位函数测试
    遗传算法二位函数测试,主要测试遗传算法的寻优能力(Genetic algorithm two bit function test)
    2016-08-30 10:42:14下载
    积分:1
  • 696518资源总数
  • 105651会员总数
  • 15今日下载