Location:
Search - branch and cut
Search list
Description: 干涉合成孔径雷达成像的相位解缠的枝切法程序。-Interferometric synthetic aperture radar imaging of the phase unwrapping process of the branch-cut method.
Platform: |
Size: 13312 |
Author: wang yan |
Hits:
Description: 无向图的最大割:对于给定的无向图G，设计一个优先队列式分支限界法，计算G的最大割。-Undirected graph of the largest cut: For a given undirected graph G, the design of a priority queue-type branch and bound method to calculate G, the largest cut.
Platform: |
Size: 5120 |
Author: Jacky Gao |
Hits:
Description: 在模式识别应用中，用分支定界法(branch-and-board method)进行特征的选择。该程序在matlab环境下实现了该算法，以从六个特征中选择两个最佳特征为例-In pattern recognition applications, using branch and bound method (branch-and-board method) to carry out the characteristics of choice. The program in the matlab environment to achieve the algorithm to select from the following six characteristics of the best features of the two as an example
Platform: |
Size: 6144 |
Author: 陈坚 |
Hits:
Description: 1). 用红、绿、黄三色发光二极管作信号灯。主干道为东西向，有红、绿、黄三个灯；支干道为南北向，也有红、绿、黄三个灯。红灯亮禁止通行；绿灯亮允许通行；黄灯亮则给行驶中的车辆有时间停靠到禁行线之外。
2).由于主干道车辆较多而支干道车辆较少，所以主干道绿灯时间较长。当主干道允许通行亮绿灯时，支干道亮红灯。而支干道允许通行亮绿灯时，主干道亮红灯，两者交替重复。主干道每次放行50秒，支干道每次放行30秒。
在每次由亮绿灯变成亮红灯的转换过程中间，需要亮5秒的黄灯作为过渡，以使行驶中的车辆有时间停靠到禁行线以外。
3). 能实现正常的、即时显示功能。用DE2上的四个七段数码管作为倒计时显示器。分别显示东西、南北方向的红灯、绿灯、黄灯时间。
4).能实现特殊状态的功能显示。设S为特殊状态的传感器信号，当Ｓ=1时，进入特殊状态。当Ｓ=0时，退出特殊状态。按S后，能实现特殊状态功能：
（1）显示器闪烁；
（2）计数器停止计数并保持在原来的数据；
（3）东西、南北路口均显示红灯状态；
（4）特殊状态结束后，能继续对时间进行计数。
5).能实现总体清零功能。按下R后，系统实现总清零，计数器由初始状态开始计数，对应状态的指示灯亮。
-1). With red, green, yellow three-color light-emitting diodes for lights. For the east-west trunk road, has red, green, yellow three lights support for the north-south trunk road, there are red, green, yellow three lights. Red light curfew green permit passage yellow light is to the moving vehicles have the time of call to cut outside the lane.
2). Because of the trunk road vehicles more vehicles and less trunk extension, so a longer green time of a main road. When the main road access permit a green light when the trunk road red sticks. Permit access roads and support a green light when the trunk road red, the two alternating repetition. Allowed 50 seconds for each trunk, branch trunk release each 30 seconds.
At each green light into red by the conversion process between the need for five seconds of yellow light as a transitional measure to enable the moving vehicles have the time of call to ban outside lane.
3). To achieve a normal, real-time display. Using DE2 four seventh
Platform: |
Size: 2048 |
Author: 靓仔 |
Hits:
Description: 分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。-Branch and cut is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to integer values. The method is a hybrid of branch and bound and cutting plane methods.
Platform: |
Size: 1384448 |
Author: abrahamlau |
Hits:
Description: Branch—and—Price，一种广义分枝定界或分枝定界的扩展算法，它允许列生成过程应用于整个分枝定界树-The philosophy of branch-and-price is similar to that of branch-and-cut except that the procedure focuses on col- umn generation rather than row generation.
Platform: |
Size: 621568 |
Author: abrahamlau |
Hits:
Description: This file contains my project from Algorithm class on Traveling Salesman Problem. It implements some branch and bound methods to increase it s performance. In the main function you can find that I use Drzewo() function Drzewoopt() functins stand for optimal search using sorted city tabel. Each Drzewo() function represents diffrent way to cut off non optimal solutions with increasing effectivity
Platform: |
Size: 4345856 |
Author: Antoni |
Hits:
Description: cutting algorith for branch and cut
Platform: |
Size: 1024 |
Author: OLIVER |
Hits:
Description: 找到的一个B&B 源码，感觉很好用。共享一下-MATLAB code for the branch and cut algorithm
Platform: |
Size: 1024 |
Author: dexter |
Hits:
Description: 分支界限法是由“分支”和“界限”策略两个部分组成，其中“分支”策略是对问题空间按照广度优先的策略进行搜索；“限界”策略是为了加速搜索速度而采用启发信息剪枝的策略。
使用分支限界法来解决单源最短路径问题时主要利用结点控制关系剪枝，在一般情况下，如果解空间树中以结点Y为根的子树中所含的解优于以结点X为根的子树中所含的解，则结点Y控制了结点X，以被控制的结点X为根的子树可以剪去。算法实现时，使用邻接矩阵表示图，二维数组存储图的邻接矩阵，使用数组记录源到各顶点的距离和路径上的前驱顶点。
-Branch and bound by the "branch" and "boundaries" strategy of two parts, one "branch" strategy is the problem of space in accordance with the breadth-first search strategy "bound" strategy is to accelerate the search speed and the use of heuristic pruning strategy.
Using the branch and bound method to solve the single-source shortest path problem between the main control by pruning nodes, in general, if the solution space to the tree root node Y is contained in the solution sub-tree nodes than to X is the root of the solution contained in the subtree, then Y control the end point node X, to be controlled node X is the root of the sub-tree can be cut. Algorithm, the use of adjacency matrix graph, two-dimensional array stored in the adjacency matrix, using an array of records from the source to the vertex distance and path of the precursor peak.
Platform: |
Size: 1024 |
Author: ss |
Hits:
Description: branch and cut 代码实现及说明-branch and cut
Platform: |
Size: 4096 |
Author: leilei |
Hits:
Description: 设计一个只有四种信号灯的交通灯控制器：由一条主干道和—条支干道汇合成十字路口，在每个入口处设置红、绿、黄、左拐允许四盏信号灯，红灯亮禁止通行，绿灯亮允许通行，黄灯亮则给行驶中的车辆有时间停在禁行线外，左拐灯亮允许车辆向左拐弯。信号灯变换次序为：主支干道交替允许通行，主干道每次放行40s，亮5s红灯让行驶中的车辆有时间停到禁行线外，左拐放行15s，克5s红灯；支干道放行30s，亮5s黄灯，左拐放行15s，亮5s红灯……。各计时电路为倒计时显示。-Only four traffic lights to design a traffic signal controller: from a main road and- bar branch roads merged into the crossroads, the entrance of each set of red, green, yellow, turn left to allow four lights, red light is closed to traffic, the green light to allow passage, the yellow light is to have time to moving vehicles parked outside the line of the cut line, allowing the vehicle to the left turn left turn lights. The order of signal conversion: the main branch roads alternately allow passage, each trunk release 40s, 5s bright red light to moving vehicles have time to stop the entry lane, the left release of 15s, 5s grams of red light branch trunk release 30s, 5s bright yellow light, turn left release 15s, 5s red light ... .... The countdown timer circuit.
Platform: |
Size: 15360 |
Author: 小石头 |
Hits:
Description: 分支定界法、割平面法、隐式枚举法的整数规划matlab源代码-The branch and bound method for, cut plane method, the method of implicit enumeration methods of integer programming matlab source code
Platform: |
Size: 3072 |
Author: lzyacht |
Hits:
Description: Matlab编写的相位展开(相位解缠)，程序实现两种相位展开(相位解缠)的算法，一个是质量图导引路径积分相位展开算法，另一个是Goldstein的枝切法。-2D PHASE UNWRAPPING ALGORITHMS
for the phase quality guided phase unwrapping method and Goldstein s branch cut phase unwrapping method
Platform: |
Size: 40960 |
Author: 莉莉 |
Hits:
Description: 来自国外的2D phase unwrap 的matlab源码。基于branch cut(剪枝法) 及FloodFill（洪泛法）实现。速度很快。相位解卷绕精度高。-2D phase unwrap from abroad matlab source. Based branch cut (Pruning) and FloodFill (flooding method). Fast. Phase unwrapping high precision.
Platform: |
Size: 40960 |
Author: yz |
Hits:
Description: 分支界限法求解整数规划，matlab
分支界限法求解整数规划，matlab-branch and cut with matlab
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 给定电路图的矩阵表现形式，含有各个支路的连接点及支路导纳。
程序中需要注意电压基准点的处理。当选定基准点后，如果其不是最后一个节点，则节点导纳阵中其后的节点对应的位置值在查找时应该减1。
主程序主要是存储元素，然后显示存储结果，其次选择要查找的元素，输入非法则重新查找，否则正确查找并输出，最后选择是否继续查找，需要则进行前一步，否则程序结束。
存储对角元素就是将含某个行号的值累加赋给相应的DJ数组对角元即可。
存储非对角元素，从第一行开始存储，先遍历电路的矩阵表示形式，对含有节点1的支路导纳负值进行存储，相应行的非零元个数加1，另一个较大的作为列号，存储过的行在电路矩阵中清零，而后进行第二行的存储，依次类推，直至存储完所有的行即可。
查找元素，判断是否为对角元，是则从DJ数组中输出；不是则计算其前面所有行的非零元的个数，从此之后的FD数组中，遍历其后的此行非零元的个数个数，从中查找是否有要找的值，有则输出，没有则说明对应元素的值应该是0。-Given pattern matrix forms, containing various branches of the connection point and branch admittance. The program needs to pay attention to handling the voltage reference point. When you have selected the reference point, if it is not the last node, the node admittance matrix in the subsequent position value corresponding node should be cut when looking for a. Main program storage element, and then store the result is displayed, followed by the elements you want to find, then re-enter the illegal search, find and otherwise correct output, the final choice of whether to continue the search, you need to make before you step in. Otherwise, the program ends. Storage diagonal element is the line number containing a cumulative value assigned to the corresponding diagonal element of the array to DJ. Stored off-diagonal elements, the first line storage, first traverse the circuit matrix representation of the branch guide contains negative node 1 is satisfied for storage, the corresponding li
Platform: |
Size: 211968 |
Author: dalin |
Hits:
Description: 该设计严格按照现实中的交通灯设计，利用vhdl硬件描述语言实现，设计一个交通信号灯控制器，由一条主干道和一条支干道汇合成十字路口，在每个入口处设置红、绿、黄三色信号灯，红灯亮禁止通行，绿灯亮允许通行，黄灯亮则给行驶中的车辆有时间停在禁行线外。
2、 红、绿、黄发光二极管作信号灯，。
3、 主干道处于常允许通行的状态，支干道有车来时才允许通行。主干道亮绿灯时，支干道亮红灯；支干道亮绿灯时，主干道亮红灯。
4、 主、支干道均有车时，两者交替允许通行，主干道每次放行45秒，支干道每次放行25秒，设立45秒、25秒计时、显示电路。
5、 在每次由绿灯亮到红灯亮的转换过程中，要亮5秒黄灯作为过渡，使行驶中的车辆有时间停到禁行线外，设立5秒计时、显示电路。
-The design is in strict accordance with the reality of the traffic light design using vhdl hardware description language, a traffic signal controller design, consists of a main road and branch roads merge into a crossroads at the entrance to each set of red, green and yellow color lights, red light no-go, the green light to allow passage, the yellow light to travel in a vehicle parked in the time to cut the line off-line.
2, red, green and yellow LEDs for lights.
3, the main road in the normally allows passage of state, branch roads to car traffic is permitted. A green light when the main road, branch roads red green light when the branch roads, main roads red.
4, the main, branch roads are car, alternating between the two to allow access, trunk release every 45 seconds, every branch roads clearance 25 seconds, and the establishment of 45 seconds, 25 seconds chronograph, the display circuit.
5, each time by a green light to red light conversion process, to bright yellow as a trans
Platform: |
Size: 3492864 |
Author: 刘鹏坤 |
Hits:
Description: 给定网络N，求其关联矩阵A，基本回路矩阵 ，基本割集矩阵 。
给定网络N，形成节点导纳矩阵Y，求逆得Z；利用支路追加法对追加一条支路（树支/连支）后的网络进行修正。
利用稀疏存储技术实现对 的查找；节点优化技术（动态、半动态）；因子表技术。(Given network N, and its associated matrix A, basic circuit matrix, the basic cut set matrix.
Given the network N, the node admittance matrix Y is formed and the inverse Z is obtained. The network is added to the network after adding a branch (tree branch / branch).
The use of sparse storage technology to achieve the search; node optimization technology (dynamic, semi dynamic); factor table technology.)
Platform: |
Size: 90112 |
Author: wencarry
|
Hits:
Description: 利用枝切法和质量图法引导相位解缠，可用于InSAR数据处理(Phase unwrapping guided by branch-cut method and mass graph method)
Platform: |
Size: 41984 |
Author: yttttt |
Hits: