Pages that link to "Item:Q930943"
From MaRDI portal
The following pages link to The graph coloring problem: A neuronal network approach (Q930943):
Displaying 12 items.
- An adaptive, multiple restarts neural network algorithm for graph coloring (Q1268156) (← links)
- Neural network-based heuristic algorithms for hypergraph coloring problems with applications. (Q1414734) (← links)
- Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem (Q1686849) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- The generalized quadratic knapsack problem. A neuronal network approach (Q2507299) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- Informed reactive tabu search for graph coloring (Q2853412) (← links)
- A kind of BP neural network algorithm based on grey interval (Q3082684) (← links)
- Advances in Neural Networks – ISNN 2005 (Q5706986) (← links)
- Parameter tuning of continuous Hopfield network applied to combinatorial optimization (Q6496420) (← links)
- Optimizing hyperparameters in Hopfield neural networks using evolutionary search (Q6613962) (← links)
