Recommendations
- A variable neighborhood search for graph coloring.
- A search space ``cartography for guiding graph coloring heuristics
- An adaptive memory algorithm for the k-coloring problem
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
- New variable neighborhood search method for minimum sum coloring problem on simple graphs
Cites work
- A branch-and-cut algorithm for graph coloring
- A Column Generation Approach for Graph Coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A metaheuristic approach for the vertex coloring problem
- A survey of local search methods for graph coloring
- A variable neighborhood search for graph coloring.
- An adaptive memory algorithm for the k-coloring problem
- Chromatic Scheduling and the Chromatic Number Problem
- Efficient algorithms for finding critical subgraphs
- Finding the chromatic number by means of critical graphs
- Genetic and hybrid algorithms for graph coloring
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 3257176 (Why is no real title available?)
- scientific article; zbMATH DE number 956854 (Why is no real title available?)
- Hybrid evolutionary algorithms for graph coloring
- Nombre chromatique et plus longs chemins d'un graphe
- On edge orienting methods for graph coloring
- Reformulation descent applied to circle packing problems
- Using tabu search techniques for graph coloring
- Variable neighborhood search
Cited in
(36)- Variable neighbourhood search: Methods and applications
- A search space ``cartography for guiding graph coloring heuristics
- A memetic algorithm for graph coloring
- A variable neighborhood search for graph coloring.
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Coloring large graphs based on independent set extraction
- On local search for the generalized graph coloring problem
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- Simple decentralized graph coloring
- A note on solving MINLP's using formulation space search
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- An adaptive memory algorithm for the k-coloring problem
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- Informed reactive tabu search for graph coloring
- An extraction and expansion approach for graph coloring
- A survey on vertex coloring problems
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- New variable neighborhood search method for minimum sum coloring problem on simple graphs
- An investigation into two bin packing problems with ordering and orientation implications
- Heuristics for a project management problem with incompatibility and assignment costs
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
- Graph coloring models and metaheuristics for packing applications
- Hybrid evolutionary algorithm for the b-chromatic number
- Graphical method of representing variable sets for solving search problems
- A heuristic for the circle packing problem with a variety of containers
- Improving the extraction and expansion method for large graph coloring
- A faster algorithm for the 4-coloring problem
- Graph colouring approaches for a satellite range scheduling problem
- Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem
- A cooperative search method for the \(k\)-coloring problem
- 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
This page was built for publication: Variable space search for graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955321)
