Pages that link to "Item:Q1861926"
From MaRDI portal
The following pages link to Tabu search with simple ejection chains for coloring graphs (Q1861926):
Displaying 13 items.
- Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem (Q306092) (← links)
- Using tabu search techniques for graph coloring (Q580987) (← links)
- A new approach for scheduling independent tasks with multiple modes (Q835753) (← links)
- EPCOT: An efficient procedure for coloring optimally with Tabu Search (Q1802494) (← links)
- Applying tabu search to determine new Ramsey graphs (Q1918865) (← links)
- A graph coloring heuristic using partial solutions and a reactive tabu scheme (Q2456655) (← links)
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling (Q2668746) (← links)
- Informed reactive tabu search for graph coloring (Q2853412) (← links)
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
- Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP (Q4356654) (← links)
- (Q4495173) (← links)
- Algoritmo de búsqueda tabú para una variante del problema de coloración (Q5262602) (← links)
- Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem (Q6114925) (← links)