Pages that link to "Item:Q2861511"
From MaRDI portal
The following pages link to A tabu search approach for the sum coloring problem (Q2861511):
Displaying 15 items.
- A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
- Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
- An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
- On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application (Q1791912) (← links)
- EPCOT: An efficient procedure for coloring optimally with Tabu Search (Q1802494) (← links)
- Tabu search with simple ejection chains for coloring graphs (Q1861926) (← links)
- A new ant colony optimization algorithm for the lower bound of sum coloring problem (Q1951174) (← links)
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (Q2003584) (← links)
- Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem (Q2011610) (← links)
- Reinforcement learning based tabu search for the minimum load coloring problem (Q2147014) (← links)
- Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
- A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
- (Q4495173) (← links)
- Algoritmo de búsqueda tabú para una variante del problema de coloración (Q5262602) (← links)
