搜索资源列表
duoduantu
- 这是计算机算法基础中的动态规划的方法的一个例子，多段图是一个很经典的问题！这里的程序用于求解最小成本路径，用类似的思想可以解决最优分配方案的问题！-This is a computer algorithm based on the dynamic programming methods of an example, many of the map is a classic question! Here the procedures for calculating the minimum cost
rates
- 基于CPLEX半连续变量求解发电机组单时段经济调度问题，给定负荷需求，求每台发电机输出P=0或Pmin<=P<=Pmax,使发电成本最小。-Semi-continuous variable based on CPLEX to solve a single period of economic generator scheduling problem, given the load demand, seeking each generator output P = 0 or Pmin
Risk_MonteCarlo
- Monte Carlo 风险分析 工具-RiskSim provides random number generator functions as inputs for your model, automates Monte Carlo simulation, and creates charts. Your spreadsheet model may include various uncontrollable uncertainties as input assumptions (e
dynopt_4.1.3
- 基于Biegler动态优化正交配置法（联立算法）的matlab 代码，由M.Cizniar，M. Fikar等编写-dynopt is a set of MATLAB functions for determination of optimal control trajectory by given descr iption of the process, the cost to be minimised, subject to equality and inequality const
MovingLeast-SquaresMLS
- 建立了一种基于移动最小二乘(Moving Least-Squares MLS)法的曲线曲 面拟合方法 这种方法对传统的最小二乘(LS)法的作了比较大的改进 使生成的曲线曲面具 有精度高 光滑性好等许多优点 详细介绍了移动最小二乘法的原理 应用和特点 并且给 出了使用移动最小二乘法进行曲线曲面拟合的程序设计流程 最后给出了曲线拟合和空间散 乱数据曲面拟合算例 将拟合结果与最小二乘拟合结果作了比较 分析了 MLS 拟合曲线曲 面的光滑性和拟合质量 表明了该方法的优越性和有效性-W
router_calc
- 根据一个有权的无向图生成指定结点（路由器）的路由表设有结点N，N的路由表由若干个路由项组成，路由项是<目的结点，下一跳>的二元组，其中目的结点是以N结点为源结点，通过N结点可以直接到达（目的结点是N结点的邻居）或通过N结点的邻居可间接到达的结点，其中下一跳即N结点的某领居，通过该邻居可间接到达目的结点，且到达目的结点的路径为最小代价路径.-According to a right of the undirected graph to generate the specified no
Movingleastsquaremethodbasedonthecurveandsurfacefi
- 建立了一种基于移动最小二乘(Moving Least-Squares MLS)法的曲线曲 面拟合方法这种方法对传统的最小二乘(LS)法的作了比较大的改进使生成的曲线曲面具 有精度高光滑性好等许多优点详细介绍了移动最小二乘法的原理应用和特点并且给 出了使用移动最小二乘法进行曲线曲面拟合的程序设计流程最后给出了曲线拟合和空间散 乱数据曲面拟合算例将拟合结果与最小二乘拟合结果作了比较分析了MLS 拟合曲线曲 面的光滑性和拟合质量表明了该方法的优越性和有效性-The establis
dijkstra5
- For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single
prim
- Prim s Algorithm for Minimimum-Cost Spanning Tr-Prim s Algorithm for Minimimum-Cost Spanning Tree
cv7
- Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {} friend bool operator<(const Edge& a, const Edge& b) { if (a.cost != b.cost) { return a.cost > b.cost }
sum
- n件工作分给n各人完成，将第i个工作分配给第j个人完成需要费用cij，是设计一算法，为每个人分配不用的工作，费用最少-n to n pieces of work hours each to complete, will for the first i jobs j assigned to the first individual to complete required cost cij, is to design an algorithm, for each person assigned d
gongzuofenpei
- 设有n个件工作分配给n个人。将工作i分配给第j个人所学要的费用为Cij。试设计一个算法，为每个人都分配1件工作，并使总费用达到最小-With n-pieces of work assigned to the n individuals. Will be allocated to the first j of work i personally have learned to cost Cij. Try to design an algorithm for each person assigned
DIJKSTRA
- Dijkstra s algorithm.For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex.
mcFlo
- mcFlo reads a wflograph from stdin, computes a min cost maximum flow using the method specified by the argument and then prints the wflograph with the computed flow.
TSPVCCODE
- 本算法主要是解决传统的旅行商问题最小成本下求解最小路径的问题，已经验证可以运行，没有错误，希望对大家有帮助-This algorithm is mainly to solve the traditional traveling salesman problem minimum cost path for solving the minimum problem has been demonstrated to run, no error, we want to help
Desktop
- 游泳池的问题，游泳池周围建一圆形过道。并在其四周围上栅栏。求过道和栅栏的造价。-Swimming pool problems swimming pool built around a circular hallway. And its four surrounding the fence. Find the cost of the aisle and the fence.
FFT_bigint.cpp.tar
- FFT实现的nlogn复杂度的高精度乘法-big intege based on FFT, time cost O(nlogn)
cost.cpp
- A program that lets user to enter quantity and price of an item and a function that finds the cost of product i.e. price*qty including tax
SuccessiveShortest
- This algoritm minimum cost flow wiht succesive succes algoritm. It s easy to learning person algoritm. You try this.-This is algoritm minimum cost flow wiht succesive succes algoritm. It s easy to learning person algoritm. You try this.
Fence-cost
- 栅栏造价，利用所编程序计算出建造自定义的栅栏所需要的花费-Fence cost, calculated using the programmed custom fence construction cost of the required