Pages that link to "Item:Q976050"

The following pages link to An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050):

Displaying 18 items.

• A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
• Memetic search for the max-bisection problem (Q339560) (← links)
• Quantum annealing of the graph coloring problem (Q429697) (← links)
• Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
• Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
• A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
• Coloring large graphs based on independent set extraction (Q1761974) (← links)
• An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
• Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
• Reinforcement learning based tabu search for the minimum load coloring problem (Q2147014) (← links)
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
• A multi-parent genetic algorithm for the quadratic assignment problem (Q2359229) (← links)
• A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
• INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING (Q2853412) (← links)
• AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING (Q2868189) (← links)
• Safe Lower Bounds for Graph Coloring (Q3009768) (← links)
• Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769) (← links)