Location:
Search - min cost
Search list
Description: 模拟退火算法 模拟退火算法(Simulated Annealing,简称SA算法)是模拟加热熔化的金属的退火过程，来寻找全局最优解的有效方法之一。 模拟退火的基本思想和步骤如下： 设S＝{s1,s2,…,sn}为所有可能的状态所构成的集合， f：S—R为非负代价函数，即优化问题抽象如下： 寻找s*∈S，使得f(s*)＝min f(si) 任意si∈S （1）给定一较高初始温度T，随机产生初始状态S （2）按一定方式，对当前状态作随机扰动，产生一个新的状态S’ S’＝S＋sign(η).δ 其中δ为给定的步长， η为[－1,1]的随机数-simulated annealing algorithm (Simulated Annealing, or SA algorithm) is a simulation of heating molten metal in the annealing process, to find the global optimum one of the effective ways. Simulated Annealing basic ideas and the steps are as follows : S = (s1, s2, ..., sn) for all possible state posed by the pool, f : S-R non-negative cost function, that is abstract optimization problems are as follows : Find S * s, making f (s *) = min f (si) arbitrary si S (1) to set a higher initial temperature T, randomly generated initial state S (2) of a certain form, the current state of random disturbance, have a new state S 'S' = S + sign (). delta where given for the step, [-1,1] Random Number
Platform: |
Size: 55205 |
Author: qianyg |
Hits:
Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.
Platform: |
Size: 4853791 |
Author: 陈宝文 |
Hits:
Description: This class loads a texture file and prepares it to be used in OpenGL. It can open a bitmap or a targa file. The min filter is set to mipmap b/c
they look better and the performance
cost on modern video cards in negligible. -This class loads a file and prepare texture s it to be used in OpenGL. It can open a bitmap or a t arga file. The min filter is set to mipmap b / c the y look better and the performance cost on modern video cards in negligible.
Platform: |
Size: 123598 |
Author: werwerwer |
Hits:
Description: 模拟退火算法 模拟退火算法(Simulated Annealing,简称SA算法)是模拟加热熔化的金属的退火过程，来寻找全局最优解的有效方法之一。 模拟退火的基本思想和步骤如下： 设S＝{s1,s2,…,sn}为所有可能的状态所构成的集合， f：S—R为非负代价函数，即优化问题抽象如下： 寻找s*∈S，使得f(s*)＝min f(si) 任意si∈S （1）给定一较高初始温度T，随机产生初始状态S （2）按一定方式，对当前状态作随机扰动，产生一个新的状态S’ S’＝S＋sign(η).δ 其中δ为给定的步长， η为[－1,1]的随机数-simulated annealing algorithm (Simulated Annealing, or SA algorithm) is a simulation of heating molten metal in the annealing process, to find the global optimum one of the effective ways. Simulated Annealing basic ideas and the steps are as follows : S = (s1, s2, ..., sn) for all possible state posed by the pool, f : S-R non-negative cost function, that is abstract optimization problems are as follows : Find S* s, making f (s*) = min f (si) arbitrary si S (1) to set a higher initial temperature T, randomly generated initial state S (2) of a certain form, the current state of random disturbance, have a new state S 'S' = S+ sign (). delta where given for the step, [-1,1] Random Number
Platform: |
Size: 55296 |
Author: |
Hits:
Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.
Platform: |
Size: 4853760 |
Author: 陈宝文 |
Hits:
Description: This class loads a texture file and prepares it to be used in OpenGL. It can open a bitmap or a targa file. The min filter is set to mipmap b/c
they look better and the performance
cost on modern video cards in negligible. -This class loads a file and prepare texture s it to be used in OpenGL. It can open a bitmap or a t arga file. The min filter is set to mipmap b/c the y look better and the performance cost on modern video cards in negligible.
Platform: |
Size: 2255872 |
Author: werwerwer |
Hits:
Description: 最大最小流程序。包括最大流网络，最小费用最大流。算法的一些实现。-Max-min flow procedures. Including the maximum flow network, minimum cost maximum flow. Some of realize algorithm.
Platform: |
Size: 110592 |
Author: HuiCong |
Hits:
Description: 网络优化算法：最小费用流的消圈算法cyclecanceling-Network Optimization Algorithms: Minimum Cost Flow Algorithm circle of extinction cyclecanceling
Platform: |
Size: 2048 |
Author: 叶博 |
Hits:
Description: opnet下修改AODV路由协议，将min hop routing 改为min cost routing，附说明文档-opnet to modify the AODV routing protocol, the min hop routing changed to min cost routing, attached documentation
Platform: |
Size: 3243008 |
Author: 孙亮 |
Hits:
Description: This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providing a general understanding of the ideas involved rather than heavy theory or technical details for a more in-depth look at this topic, check out the references at the end of this article, in particular [1]. -This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providing a general understanding of the ideas involved rather than heavy theory or technical details for a more in-depth look at this topic, check out the references at the end of this article, in particular [1].
Platform: |
Size: 30720 |
Author: peter norton |
Hits:
Description: This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providing a general understanding of the ideas involved rather than heavy theory or technical details for a more in-depth look at this topic, check out the references at the end of this article, in particular [1]. -This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providing a general understanding of the ideas involved rather than heavy theory or technical details for a more in-depth look at this topic, check out the references at the end of this article, in particular [1].
Platform: |
Size: 755712 |
Author: peter norton |
Hits:
Description: This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providing a general understanding of the ideas involved rather than heavy theory or technical details for a more in-depth look at this topic, check out the references at the end of this article, in particular [1]. -This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providing a general understanding of the ideas involved rather than heavy theory or technical details for a more in-depth look at this topic, check out the references at the end of this article, in particular [1].
Platform: |
Size: 5120 |
Author: peter norton |
Hits:
Description: This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providing a general understanding of the ideas involved rather than heavy theory or technical details for a more in-depth look at this topic, check out the references at the end of this article, in particular [1]. -This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providing a general understanding of the ideas involved rather than heavy theory or technical details for a more in-depth look at this topic, check out the references at the end of this article, in particular [1].
Platform: |
Size: 8192 |
Author: peter norton |
Hits:
Description: This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providing a general understanding of the ideas involved rather than heavy theory or technical details for a more in-depth look at this topic, check out the references at the end of this article, in particular [1]. -This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providing a general understanding of the ideas involved rather than heavy theory or technical details for a more in-depth look at this topic, check out the references at the end of this article, in particular [1].
Platform: |
Size: 8192 |
Author: peter norton |
Hits:
Description: This article covers the so-called "min-cost flow" problem, which has many applications for both TopCoder competitors and professional programmers. The article is targeted to readers who are not familiar with the subject, with a focus more on providing a general understanding of the ideas involved rather than heavy theory or technical.
Platform: |
Size: 9216 |
Author: peter norton |
Hits:
Description: 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.
Platform: |
Size: 614400 |
Author: hellrider |
Hits:
Description: min cost max flow template in java
Platform: |
Size: 1024 |
Author: moonto |
Hits:
Description: 主要实现求钢管运输与订购的最小费用，并运用了floyd算法-The main requirements to achieve the minimum cost of transport and ordering steel, and use the floyd algorithm
Platform: |
Size: 1024 |
Author: hailang |
Hits:
Description: Wireless sensor networks (WSN) have attached a great attention in the last few years. WSN
offer several advantages over the traditional sensor networks, such as elimination of costly
wires, security and larger area coverage. In the last few years, there has been great interest
commercial applications based on Ultra Wideband (UWB). It has potentially low complexity,
low cost and an excellent time domain resolution which facilitates location and tracking
applications.
Platform: |
Size: 1150976 |
Author: ShAzZ |
Hits:
Description: 国外权威讲解最优化问题的书籍，对最小费用流，最佳分配，最短路径等讲解非常透彻-A book for Network Optimization. It is very useful for min cost and min path problem
Platform: |
Size: 1110016 |
Author: 杜平 |
Hits: