Pages that link to "Item:Q1043356"
From MaRDI portal
The following pages link to A memetic algorithm for graph coloring (Q1043356):
Displaying 11 items.
- An effective discrete dynamic convexized method for solving the winner determination problem (Q306103) (← links)
- A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- Memetic search for the max-bisection problem (Q339560) (← links)
- Quantum annealing of the graph coloring problem (Q429697) (← links)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
- Optimization by ant algorithms: possible roles for an individual ant (Q1758036) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
