Title:
branch-and-cut-algorithm
Download
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.
- [zichengxuku] - There is an integer multiplication, divi
- [speed] - The use of methods of measuring the freq
- [DividePlane] - The use of cutting plane method for solv
File list (Check if you may need any files):
A branch-and-cut algorithm for the undirected selective traveling salesman problem.pdf
Branch-and-Cut Algorithms for Combinatorial Optimization Problems.pdf
分支—切割法与分块TSP的分支—切割法.nh
改进的求解TSP混合分支裁剪法.pdf
