A general variable neighborhood search approach for the minimum load coloring problem

DOI10.1007/S11590-022-01861-1OpenAlexW4214843018MaRDI QIDQ6063505

J. Manuel Colmenar, Alberto Herrán, Abraham Duarte, Nenad Mladenović

Publication date: 7 November 2023

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-022-01861-1

zbMATH Keywords

metaheuristicsvariable neighborhood searchgraph coloring problemgraph partition problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Variable neighborhood search
• Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
• A variable neighborhood search approach for the vertex bisection problem
• Multi-start methods for combinatorial optimization
• Parameterized and approximation algorithms for the load coloring problem
• Parameterized algorithms for load coloring problem
• On the minimum load coloring problem
• A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem
• Fast Approximate Graph Partitioning Algorithms
• Approximation and Online Algorithms
• Variable neighborhood search: Principles and applications

This page was built for publication: A general variable neighborhood search approach for the minimum load coloring problem