Pages that link to "Item:Q1040976"
From MaRDI portal
The following pages link to A search space ``cartography'' for guiding graph coloring heuristics (Q1040976):
Displaying 17 items.
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
- Iterated maxima search for the maximally diverse grouping problem (Q323418) (← links)
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem (Q884452) (← links)
- Variable space search for graph coloring (Q955321) (← 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)
- Local optima topology for the \(k\)-coloring problem (Q1327233) (← links)
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (Q1652699) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering (Q2669483) (← links)
- Informed reactive tabu search for graph coloring (Q2853412) (← links)
- An extraction and expansion approach for graph coloring (Q2868189) (← links)
- Responsive strategic oscillation for solving the disjunctively constrained knapsack problem (Q6112824) (← links)
