分支-切割法是把分支定界法与割平面法结合起来，用来求解混合整数规划问题。 ,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

利用Java编程实现了将一个整数的分解，将一个正整数分解质因数。 -Java programming to achieve the prime factors of an integer decomposition, a positive integer factorization.

The genetic algorithm is a method for solving both constrained and unconstrained optimization problems that is based on natural selection, the process that drives biological evolution. The genetic algorithm repeatedly modifies a population of individ