[Objective] This study was to establish an optimized model for the allocation of agricultural fertilizer resources in Southern Xinjiang from the perspective of sustainable development.[Method] An optimized model for t...[Objective] This study was to establish an optimized model for the allocation of agricultural fertilizer resources in Southern Xinjiang from the perspective of sustainable development.[Method] An optimized model for the allocation of agricultural fertilizer resources was established based on their allocation structure.Combined with the actual agricultural production in Aksu areas of Southern Xinjiang,by establishing a rational evaluation index system,under the premise of considering the planting area constraints,the total water resources constraints and the security constraints of food production,we established the empirical optimal allocation model of the regional agricultural fertilizer resources in Aksu area of Southern Xinjiang.Moreover,we solved the model by using the search algorithm of computer and lingo programming.[Result] The increased economic benefit was near to 1.8 billion Yuan by adopting the optimal allocation methods,with a relative increment of about 34.4%.[Conclusion] Our results provided theoretical basis for achieving the sustainable development of agricultural economy in Southern Xinjiang.展开更多
The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an inter...The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an interval supergraph with the smallest possible number of edges; the pathwidth problem is to find an interval supergraph with the smallest possible cliquesize. These two class problems have important applications to numerical algebra, VLSI- layout and algorithm graph theory respectively; And they are known to be NP-complete for general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the exact solutions of the profile and the pathwidth of the complete multipartite graph Kn1,n2,...nr （r≥ 2） are determined.展开更多
基金Supported by National Natural Science Foundation of China(30960188)Natural Science Fund of Principal Program from Tarim University(TDZKSS09010)+1 种基金Key Principal Program from Tarim University(TDZKZD09001)Quality Engineering Program from TarimUniversity(TDZGTD09004&DZGKC09085)~~
文摘[Objective] This study was to establish an optimized model for the allocation of agricultural fertilizer resources in Southern Xinjiang from the perspective of sustainable development.[Method] An optimized model for the allocation of agricultural fertilizer resources was established based on their allocation structure.Combined with the actual agricultural production in Aksu areas of Southern Xinjiang,by establishing a rational evaluation index system,under the premise of considering the planting area constraints,the total water resources constraints and the security constraints of food production,we established the empirical optimal allocation model of the regional agricultural fertilizer resources in Aksu area of Southern Xinjiang.Moreover,we solved the model by using the search algorithm of computer and lingo programming.[Result] The increased economic benefit was near to 1.8 billion Yuan by adopting the optimal allocation methods,with a relative increment of about 34.4%.[Conclusion] Our results provided theoretical basis for achieving the sustainable development of agricultural economy in Southern Xinjiang.
基金Supported by the Natural Science Foundation of Henan Province（082300460190） Sponsored by Program for Science and Technology Innovation Talents in Universities of Henan Province.
文摘The interval graph completion problem of a graph G includes two class problems： the profile problem and the pathwidth problem, denoted as P（G） and PW（G） respectively, where the profile problem is to find an interval supergraph with the smallest possible number of edges; the pathwidth problem is to find an interval supergraph with the smallest possible cliquesize. These two class problems have important applications to numerical algebra, VLSI- layout and algorithm graph theory respectively; And they are known to be NP-complete for general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the exact solutions of the profile and the pathwidth of the complete multipartite graph Kn1,n2,...nr （r≥ 2） are determined.
