A graph coloring heuristic using partial solutions and a reactive tabu scheme-Reference-Cited by-同舟云学术

A graph coloring heuristic using partial solutions and a reactive tabu scheme

Published:2008-03 Issue:3 Volume:35 Page:960-975
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Blöchliger Ivo,Zufferey Nicolas

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference31 articles.

1. Computer and intractability;Garey,1979

2. Register allocation and spilling via graph coloring;Chaitin,1982

3. On the frequency assignment in mobile automatic telephone systems;Gamst,1992

4. A graph coloring algorithm for large scheduling problems;Leighton;Journal of Research of the National Bureau Standard,1979

5. Zufferey N. Heuristiques pour les Problèmes de la Coloration des Sommets d’un Graphe et d’Affectation de Fréquences avec Polarités. PhD Thesis, École Polytechnique Fédérale de Lausanne (EPFL), Lausanne; 2002.

Cited by 125 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context;Discrete Applied Mathematics;2024-10

2. A Memetic Algorithm with Adaptive Operator Selection for Graph Coloring;Lecture Notes in Computer Science;2024

3. Ising-Machine-Based Solver for Constrained Graph Coloring Problems;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2024-01-01

4. A massively parallel evolutionary algorithm for the partial Latin square extension problem;Computers & Operations Research;2023-10

5. Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022;ACM Journal of Experimental Algorithmics;2023-08-11