A search space ``cartography for guiding graph coloring heuristics
From MaRDI portal
Publication:1040976
DOI10.1016/J.COR.2009.06.024zbMATH Open1176.90613OpenAlexW1988405740MaRDI QIDQ1040976FDOQ1040976
Authors: Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz 
Publication date: 27 November 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.06.024
Recommendations
- A coloring algorithm for disambiguating graph and map drawings
- A Large Neighborhood Search Heuristic for Graph Coloring
- Graph colouring and its applications within cartography
- A heuristic for the coloring of planar graphs
- Publication:5752591
- scientific article; zbMATH DE number 4134072
- A semidefinite programming-based heuristic for graph coloring
- Improving graph colouring algorithms and heuristics using a novel representation
- An optimal greedy heuristic to color interval graphs
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Title not available (Why is that?)
- A survey of local search methods for graph coloring
- Frozen development in graph coloring
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Partition-distance: A problem and class of perfect graphs arising in clustering
- Using tabu search techniques for graph coloring
- An introduction to timetabling
- Graph coloring for air traffic flow management
- Variable space search for graph coloring
- An adaptive memory algorithm for the \(k\)-coloring problem
- A metaheuristic approach for the vertex coloring problem
- Chromatic Scheduling and the Chromatic Number Problem
- Title not available (Why is that?)
- A variable neighborhood search for graph coloring.
- Genetic and hybrid algorithms for graph coloring
- Title not available (Why is that?)
- Some experiments with simulated annealing for coloring graphs
- A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile
- Local optima topology for the \(k\)-coloring problem
- An algorithm for the chromatic number of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Large Neighborhood Search Heuristic for Graph Coloring
Cited In (18)
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
- An extraction and expansion approach for graph coloring
- Improving the extraction and expansion method for large graph coloring
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading
- Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem
- Iterated maxima search for the maximally diverse grouping problem
- A memetic algorithm for graph coloring
- An exact algorithm with learning for the graph coloring problem
- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
- Variable space search for graph coloring
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- A Large Neighborhood Search Heuristic for Graph Coloring
- Responsive strategic oscillation for solving the disjunctively constrained knapsack problem
- Coloring large graphs based on independent set extraction
- CHECKCOL: improved local search for graph coloring
- Local optima topology for the \(k\)-coloring problem
- Informed reactive tabu search for graph coloring
Uses Software
This page was built for publication: A search space ``cartography for guiding graph coloring heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040976)
