Pages that link to "Item:Q1919854"
From MaRDI portal
The following pages link to Genetic and hybrid algorithms for graph coloring (Q1919854):
Displaying 15 items.
- A new DNA algorithm to solve graph coloring problem (Q2644715) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- Two genetic algorithms for the bandwidth multicoloring problem (Q2853289) (← links)
- Informed reactive tabu search for graph coloring (Q2853412) (← links)
- An extraction and expansion approach for graph coloring (Q2868189) (← links)
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
- (Q4263885) (← links)
- Iterative coloring extension of a maximum clique (Q4544221) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- Consistency checking within local search applied to the frequency assignment with polarization problem (Q5479834) (← links)
- Computational Science - ICCS 2004 (Q5712867) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
- Adaptive memory programming: a unified view of metaheuristics (Q5954822) (← links)
- Source detection on graphs (Q6640145) (← links)