Variable space search for graph coloring
From MaRDI portal
Publication:955321
DOI10.1016/J.DAM.2008.03.022zbMATH Open1213.05085OpenAlexW2021735068MaRDI QIDQ955321FDOQ955321
Authors: Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey 
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
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
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of local search methods for graph coloring
- Variable neighborhood search
- A branch-and-cut algorithm for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Efficient algorithms for finding critical subgraphs
- A Column Generation Approach for Graph Coloring
- Nombre chromatique et plus longs chemins d'un graphe
- Using tabu search techniques for graph coloring
- Reformulation descent applied to circle packing problems
- Title not available (Why is that?)
- An adaptive memory algorithm for the \(k\)-coloring problem
- A metaheuristic approach for the vertex coloring problem
- Finding the chromatic number by means of critical graphs
- Chromatic Scheduling and the Chromatic Number Problem
- A variable neighborhood search for graph coloring.
- Genetic and hybrid algorithms for graph coloring
- Title not available (Why is that?)
- On edge orienting methods for graph coloring
Cited In (35)
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- An adaptive memory algorithm for the \(k\)-coloring problem
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- An investigation into two bin packing problems with ordering and orientation implications
- A variable neighborhood search for graph coloring.
- On local search for the generalized graph coloring problem
- Variable neighbourhood search: Methods and applications
- An extraction and expansion approach for graph coloring
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- 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
- Improving the extraction and expansion method for large graph coloring
- Variable neighbourhood search: methods and applications
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- A search space ``cartography for guiding graph coloring heuristics
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- A memetic algorithm for graph coloring
- A heuristic for the circle packing problem with a variety of containers
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- Simple decentralized graph coloring
- Graph colouring approaches for a satellite range scheduling problem
- Graph coloring models and metaheuristics for packing applications
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- New variable neighborhood search method for minimum sum coloring problem on simple graphs
- A cooperative search method for the \(k\)-coloring problem
- A survey on vertex coloring problems
- Coloring large graphs based on independent set extraction
- Informed reactive tabu search for graph coloring
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- Graphical method of representing variable sets for solving search problems
- Hybrid evolutionary algorithm for the b-chromatic number
- A note on solving MINLP's using formulation space search
Uses Software
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)
