The following pages link to (Q5687276):
Displaying 17 items.
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Autonomous operator management for evolutionary algorithms (Q604944) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- A memetic algorithm for graph coloring (Q1043356) (← links)
- A variable neighborhood search for graph coloring. (Q1410622) (← links)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem (Q2460104) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Informed reactive tabu search for graph coloring (Q2853412) (← links)
- Bounding vertex coloring by truncatedmultistage branch and bound (Q3157032) (← links)
- Iterative coloring extension of a maximum clique (Q4544221) (← links)
- Scheduling using tabu search methods with intensification and diversification (Q5945316) (← links)
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469) (← links)
- Meta-heuristics and artificial intelligence (Q6602249) (← links)
