State Transition Based Combinatorial Optimization
Zheng Wang · Systems Engineering · 2003
It is very difficult to solute NP problem with current technology because the set of feasible solutions is very huge. State transition based combinatorial optimization is proposed to this problem. The solution process is described with the solution of 0/1 knapsack problem. The results show that state transition based combinatorial optimization is valid.