划分问题新拟多项式算法与背包问题新求解方法研究.docxVIP

山东大学硬士论文 following equation： ∑d(曲=∑d(曲 (1) H ∑d(q)=B．Obviously,there does not exist the subset A’ ifBis aodd，SOwe assumeit as a eveninthispaper． The time complexity of solving the problem is O(nS) according to recent journals and textbooks．If each element’S length of the set is bounded by a constant D，O(nB)may be represented as O(n2D)，namely the quadratic of the input length of the instance．The partition problem will be solved by a new method named balanced technique in this paper．It is proved that if there exists a subset satisfying the condition in the partition problem，the subset must be a balance state．According to this only balanced states be enumerated SO that we can solve the partition problem．Only balanced states being considered the time complexity ofsolving the partition problem is O(nD)by the way of implementing dynamic programming if each element’S length of the given set is bounded by a constant D．This time complexity is linear time and lower the嘞al time complexity of O(n2D)in solving partition problem． First a primary subset A 6，named as break subset，needs to 一{一 6 划舟问意新拟多项式算法与背包闸逼新求解方法研究 be found while A 7，a subset of A，is being sought．Under the foundation of the break subset，a subset As∈A called the balanced state is obtained through balanced operations．The break set is also one of the balanced states．Balanced operations include balanced inserfion、balanced remove and the break set． Which practical operation will be made d印enIis on the sum of the elements’length in balanced states．Balanced remove will be made when the sum of the elements’length in the balanced state is greater than half of that in original set A．Otherwise balanced insertion will be made．Because if there exists a subset satisfying the condition the subset must be one of the balanced states， meaning we could obtain the subset by balanced operations，we then only eilLlmerate balanced states SO as to solve the partition problem．F