搜索资源列表
SimpMethodProj
- [数学问题]用分支定界发解线性混合整数规划问题,JavaSE swing 界面。-[Mathematical problem] Used branch and bound solution fat LMIP problem, JavaSE swing GUI.
The-dynamic-programming
- 用动态规划算法,JAVA实现:给定n个整数组成的序列,现在要求将序列分割为m段,每段子序列中的数在原序列中连续排序。如何分割才能使这m段子序列的和的最大值达到最小?-Using dynamic programming algorithm, JAVA implementation: the composition of a given sequence of n integers, now requires the sequence is divided into m segments, the
zsgh
- 整数规划,0-1整数规划,分支定界法求最优解-0-1 integer programming integer programming, branch and bound method for the optimal solution