np-complete การใช้

• Time - table problem is a np - complete problem
• The vrp can be regarded as an extension of the tsp and it is np - complete
• The crossing number of graph , which is an np - complete problem , has an important theory meaning
• Packing problems are categorized as discrete combinatorial optimization problems with np - complete computational complexities
• This problem refers to constructing minimum - cost spanning trees constrained by delay , which is known to be np - complete
• Timetabling problem ( tp ) is a multiobjective combination optimization problem with constraints , and also has been proved np - completed
• Scheduling problems are known to be in general np - complete , only sub - optimal can be obtained by classical scheduling approaches in most cases
• And of all scheduling problems , the job - shop scheduling problem ( jsp ) is most common and complicate , which is usually a typical np - complete problem
• The quasi - physical and quasi - sociological methods for problem - solving is a new approach to solve problems including np - completed and other pure mathematical problems
• Three - dimensional component packing is a combinatorial optimization and np - complete problem . it is difficult to find its exact global optimum
• The schedule of this kind of production can be formulated as assigning n parts to m machines . to find the optimal solution is an np - complete problem in theory
• Generally speaking , the two - dimensionsl bandwidth problem is known to be np - complete . our main results here are determining the precise value of some graphs
• Constructing an evolutionary tree is a typical np - complete problem , therefore it is of great significance to construct an algorithm capable of getting optimal approximate solutions
• The traveling salesman problem ( tsp ) is a typical optimization problem , which belongs to a large family of problems classified as np - complete . it has the important project background
• A polynomial function of 3 - sat to area minimization was given in a pubilshed thesis , this could prove the area minimization is a np - complete problem . but this must be discussed in there cases : k 5 , k = 4 , and k = 3
• The objective of multicast routing optimization is to minimize the network cost with delay constrained . finding a multicast routing tree with minimized network cost is known to be an np - complete problem in the most general case
• Genetic algorithm ( ga ) is a high - effective randomly searching algorithm , based on the nature evolution . it is a very effective algorithm to resolve np - completed combination optimization problem
• Two - dimensional irregular shape nesting system is widely used in manufacturing industry , garment , leather and architecture industry . it is a one of the np - complete problem and has been a hot research area for a long time
• Unfortunately , the problem of finding multicast routing with qos constrained is a np - complete problem . so we can not solve the problem with the classical shortest path first algorithms such as bellman - ford and dijstra
• With the fast develovment of computer technology and molecular biotechnology , dna computing as a new interdispline has been under - develovment , which has great potential in sloving large - scale parallel computation , especially in np - complete problems