Pages that link to "Item:Q2664279"
From MaRDI portal
The following pages link to A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279):
Displaying 4 items.
- A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
- An incremental search heuristic for coloring vertices of a graph (Q2056884) (← links)
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art (Q2242290) (← links)
- Expected polynomial-time randomized algorithm for graph coloring problem (Q6558677) (← links)