Iterated local search with tabu search for the weighted vertex coloring problem
From MaRDI portal
Publication:2664440
DOI10.1016/j.cor.2020.105087zbMath1458.90619OpenAlexW3083710364MaRDI QIDQ2664440
Eduardo Henrique Gomes Tavares, Bruno Nogueira, Paulo Maciel
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105087
combinatorial optimizationmetaheuristicstabu searchiterated local searchweighted vertex coloring problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On Monte Carlo tree search for weighted vertex coloring, Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring, ilsts-wvcp
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A memetic algorithm for the minimum sum coloring problem
- Exact weighted vertex coloring via branch-and-price
- Max-coloring paths: tight bounds and extensions
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
- Solving vertex coloring problems as maximum weight stable set problems
- Models and heuristic algorithms for a weighted vertex coloring problem
- A variable neighborhood search for graph coloring.
- A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs
- A hybrid iterated local search heuristic for the maximum weight independent set problem
- Adaptive feasible and infeasible tabu search for weighted vertex coloring
- A survey of local search methods for graph coloring
- A survey on vertex coloring problems
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Automata, Languages and Programming
- Handbook of metaheuristics
