搜索资源列表
MATLAB
- MATLAB分支定界法求解,大家-MATLAB branch and bound method, U.S.
beibao
- 背包问题 采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~ -Knapsack problem using Branch and Bound method to solve 0/1 Knapsack Problem! My internship on the machine operation, through the teacher acceptance, quali
BNB18
- 这是非线性整数规划模型求解分支定界迭代算法-This is a non-linear integer programming model to solve iterative algorithm branch and bound
FlowShop
- 用c++实现的批处理作业调度问题·优先队列式分支限界法·回溯法，包括Flowshop和make两个类，含有测试用的数据data-With c++ Realized the issue of batch job scheduling priority queue-style backtracking branch and bound method, including Flowshop and make the two categorie
branch_and_board
- 在模式识别应用中，用分支定界法(branch-and-board method)进行特征的选择。该程序在matlab环境下实现了该算法，以从六个特征中选择两个最佳特征为例-In pattern recognition applications, using branch and bound method (branch-and-board method) to carry out the characteristics of choic
bound-constrained_SVM
- bound-constrained SVM
01beibao
- 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code
fenzhixianjie
- 0/1背包问题的优先队列式分支限界算法程序-0/1 knapsack problem the priority queue-type branch and bound algorithm procedure
shortest-way-java
- 分支限界法 单源最短路径问题的 JAVA实现 3个源文件-Branch and bound method single-source shortest path problem JAVA realization of 3 source files
suanfashejiyufenxi
- 计算机算法设计与分析实验报告:6大算法详细实验报告(相当详细).分治,动态规划,贪心,回溯,分支限界-Computer Algorithm Design and Analysis of Experimental Report: 6 large algorithm experiment detailed report (in considerable detail). Sub-rule, dynamic programming, gree
fenzhi
- 通过分支限界的方法，求解1到n的最短路径。设数组a保存图的邻接矩阵，0-9号，共10个节点。节点1为源点，n为目标点.-Through the branch and bound approach for solving 1 to n shortest path. A preservation plan for an array of adjacency matrix ,0-9, a total of 10 nodes. Node 1 i
shortestpaths
- 一个不错的源码，关于分支限界求单源最短路径,java，推荐给大家共享，希望能相互学习-A good source, on the branch and bound for single-source shortest path, java, recommend to all to share, hoping to learn from each other
TSP
- The basic principle using the branchand- bound strategy to solve the traveling salesperson optimization problem (TSP) consists of two parts. There is a way to split the solution space. There
SimpMethodProj
- [数学问题]用分支定界发解线性混合整数规划问题，JavaSE swing 界面。-[Mathematical problem] Used branch and bound solution fat LMIP problem, JavaSE swing GUI.
fzdj
- 分支定界算法C语言实现源程序,标准C源代码，直接可以运行，程序有详细的说明-Branch and bound algorithm for C language source code implementation, the standard C source code can run directly, the program has a detailed descr iption of
45665972BoundAndBranch
- Algoritm branch and bound and shortest path in C
bnb20
- 非线性整数规划算法，求解非线性整数规划活混合规划问题，常用的算法是分枝定界算法。基于该算法编成的现成函数bnb20()-Nonlinear integer programming algorithm for solving nonlinear mixed integer programming live planning problem, commonly used algorithms are branch-and-bound alg
3D-BPP
- 3DBPP BRANCH AND BOUND
TravelingSalespersonProblem_TSP_codes
- Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower b
bestsearch
- 分支定界，找出最优解，此编程是以六个特征为例进行编程的。-Branch and bound, to find the optimal solution, this program is based on six characteristics of the program as an example.