On Monte Carlo tree search for weighted vertex coloring

DOI10.1007/978-3-031-04148-8_1zbMath1499.68273arXiv2202.01665OpenAlexW4221157017MaRDI QIDQ2163775

Olivier Goudet, Jin-Kao Hao, Cyril Grelier

Publication date: 11 August 2022

Full work available at URL: https://arxiv.org/abs/2202.01665

zbMATH Keywords

local searchgraph coloringMonte Carlo tree searchweighted vertex coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring ⋮ Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems

Uses Software

• GNU parallel
• ilsts-wvcp
• gCol

Cites Work

• Unnamed Item
• Exact weighted vertex coloring via branch-and-price
• Max-coloring paths: tight bounds and extensions
• Solving vertex coloring problems as maximum weight stable set problems
• Models and heuristic algorithms for a weighted vertex coloring problem
• Asymptotically efficient adaptive allocation rules
• Adaptive feasible and infeasible tabu search for weighted vertex coloring
• Iterated local search with tabu search for the weighted vertex coloring problem
• A Guide to Graph Colouring
• New methods to color the vertices of a graph
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Automata, Languages and Programming

This page was built for publication: On Monte Carlo tree search for weighted vertex coloring