Pages that link to "Item:Q1922632"
From MaRDI portal
The following pages link to Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (Q1922632):
Displaying 12 items.
- A graph coloring approach to the deployment scheduling and unit assignment problem (Q283268) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- What is my objective function? (Q1278819) (← links)
- A variable neighborhood search for graph coloring. (Q1410622) (← links)
- A framework for the description of evolutionary algorithms (Q1584807) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- An adaptive memory algorithm for the \(k\)-coloring problem (Q2467362) (← links)
- An improved ant colony optimisation heuristic for graph colouring (Q2473031) (← links)
- A survey of local search methods for graph coloring (Q2489304) (← links)
- (Q4263885) (← links)
- Adaptive memory programming: a unified view of metaheuristics (Q5954822) (← links)