Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring

DOI10.1007/978-3-031-30035-6_7MaRDI QIDQ6149094FDOQ6149094

Authors: Cyril Grelier, Olivier Goudet, Jin-Kao Hao 

Publication date: 12 January 2024

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

local searchhyper-heuristicMonte Carlo tree searchweighted vertex coloringlearning-driven optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27)

Cites Work

• Using tabu search techniques for graph coloring
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Solving vertex coloring problems as maximum weight stable set problems
• Models and heuristic algorithms for a weighted vertex coloring problem
• Automata, Languages and Programming
• The \(k\)-coloring fitness landscape
• Recent advances in selection hyper-heuristics
• On Monte Carlo tree search for weighted vertex coloring
• Adaptive feasible and infeasible tabu search for weighted vertex coloring
• Iterated local search with tabu search for the weighted vertex coloring problem

Cited In (1)

• A memetic algorithm with adaptive operator selection for graph coloring

This page was built for publication: Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149094)