Variable space search for graph coloring
From MaRDI portal
Publication:955321
DOI10.1016/j.dam.2008.03.022zbMath1213.05085OpenAlexW2021735068MaRDI QIDQ955321
Nicolas Zufferey, Matthieu Plumettaz, Alain Hertz
Publication date: 19 November 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.022
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Graph colouring approaches for a satellite range scheduling problem, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, A formulation space search heuristic for packing unequal circles in a fixed size circular container, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, Simple decentralized graph coloring, An investigation into two bin packing problems with ordering and orientation implications, Heuristics for a project management problem with incompatibility and assignment costs, A heuristic for the circle packing problem with a variety of containers, A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems, A note on solving MINLP's using formulation space search, Multi-coloring and job-scheduling with assignment and incompatibility costs, Graph Coloring Models and Metaheuristics for Packing Applications, A survey on vertex coloring problems, Solving the maximum min-sum dispersion by alternating formulations of two different problems, Hybrid evolutionary algorithm for the b-chromatic number, A wide-ranging computational comparison of high-performance graph colouring algorithms, Coloring large graphs based on independent set extraction, Variable neighbourhood search: methods and applications, A GRASP\(\times \)ELS approach for the capacitated location-routing problem, An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring, Improving the extraction and expansion method for large graph coloring, Variable neighbourhood search: Methods and applications, A search space ``cartography for guiding graph coloring heuristics, A memetic algorithm for graph coloring, Packing a fixed number of identical circles in a circular container with circular prohibited areas, INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING, AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- Variable neighborhood search
- A variable neighborhood search for graph coloring.
- Reformulation descent applied to circle packing problems
- Genetic and hybrid algorithms for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- On edge orienting methods for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Efficient algorithms for finding critical subgraphs
- An adaptive memory algorithm for the \(k\)-coloring problem
- A survey of local search methods for graph coloring
- A branch-and-cut algorithm for graph coloring
- A Metaheuristic Approach for the Vertex Coloring Problem
- A Column Generation Approach for Graph Coloring
- Finding the chromatic number by means of critical graphs
- Nombre chromatique et plus longs chemins d'un graphe
- Chromatic Scheduling and the Chromatic Number Problem
