Reinforcement learning based tabu search for the minimum load coloring problem
From MaRDI portal
(Redirected from Publication:2147014)
Recommendations
- A tabu search approach for the sum coloring problem
- Routing and wavelength assignment by partition colouring
- Algoritmo de búsqueda tabú para una variante del problema de coloración
- scientific article; zbMATH DE number 1488073
- Tabu search guided by reinforcement learning for the max-mean dispersion problem
Cites work
- scientific article; zbMATH DE number 558543 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A survey of local search methods for graph coloring
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
- An efficient memetic algorithm for the graph partitioning problem
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- Heuristic search to the capacitated clustering problem
- Hybrid evolutionary algorithms for graph coloring
- Memetic search for the max-bisection problem
- On the minimum load coloring problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Optimization by simulated annealing
- Parameterized algorithms for load coloring problem
- Parameterized and approximation algorithms for the load coloring problem
- Sur le coloriage des graphs
- TTT plots: a perl program to create time-to-target plots
Cited in
(7)- An effective hybrid evolutionary algorithm for the clustered orienteering problem
- Optimal pivot path of the simplex method for linear programming based on reinforcement learning
- A general variable neighborhood search approach for the minimum load coloring problem
- Tabu search guided by reinforcement learning for the max-mean dispersion problem
- Informed reactive tabu search for graph coloring
- A multi-objective linear programming model for scheduling part families and designing a group layout in cellular manufacturing systems
- Learning driven three-phase search for the maximum independent union of cliques problem
This page was built for publication: Reinforcement learning based tabu search for the minimum load coloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147014)