搜索资源列表
tsp.c
- 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes
LCKNAP
- 01背包问题的优先队列式分枝限界算法程序LCKNAP
beibao
- 背包问题 采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~
LCbb_TSP
- LC分枝限界法解货郎担—代码-LC Branch and Bound Solving traveling salesman - code
intprog
- 分枝定界法程序，解混合整数线性规划《详解MATLAB在最优化计算中的应用》中的分枝定界法程序，稍作了修改-Branch and bound method procedures, the solution mixed integer linear programming, " Detailed MATLAB optimization calculation in the application" in the branch and bound procedure, slightl