The location problem is one kind of special type optimized problems .The Min-max weighted distance problem is a new class of location problem, its decision problem is a NP- Complete problem. In this paper, some approx...
详细信息
The location problem is one kind of special type optimized problems .The Min-max weighted distance problem is a new class of location problem, its decision problem is a NP- Complete problem. In this paper, some approximate algorithms are designed, designs a genetic algorithm by some properties of the problem, and gives the design and selection method of crossover operator, mutation operator and reproduction operator.
The location problem is one kind of special type optimized problems .The Min-max weighted distance problem is a new class of location problem, its decision problem is a NP-Complete problem. In this paper, some approxi...
详细信息
The location problem is one kind of special type optimized problems .The Min-max weighted distance problem is a new class of location problem, its decision problem is a NP-Complete problem. In this paper, some approximate algorithms are designed, designs a genetic algorithm by some properties of the problem, and gives the design and selection method of crossover operator, mutation operator and reproduction operator.
Graphs can be effectively used to represent relationships between objects such as social networks, web search engines and genome sequencing. In this paper, we deal with two variants of graph matching, the graph isomor...
详细信息
ISBN:
(纸本)9781509018949
Graphs can be effectively used to represent relationships between objects such as social networks, web search engines and genome sequencing. In this paper, we deal with two variants of graph matching, the graph isomorphism with restriction and the prefix set of graph isomorphism. We propose polynomial-time exact algorithms for these problems on graphs with tree-like structure. These could be useful tools for big data processing.
暂无评论