A survey of local search methods for graph coloring
From MaRDI portal
Publication:2489304
Recommendations
Cites work
- A graph coloring algorithm for large scheduling problems
- A variable neighborhood search for graph coloring.
- An adaptive memory algorithm for the k-coloring problem
- An application of graph coloring to printed circuit testing
- An introduction to timetabling
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- Future paths for integer programming and links to artificial intelligence
- Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
- Genetic and hybrid algorithms for graph coloring
- scientific article; zbMATH DE number 956854 (Why is no real title available?)
- Hybrid evolutionary algorithms for graph coloring
- New methods to color the vertices of a graph
- Optimization by simulated annealing
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Probabilistic diversification and intensification in local search for vehicle routing
- Some experiments with simulated annealing for coloring graphs
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Tabu Search—Part I
- Using tabu search techniques for graph coloring
- Variable neighborhood search
Cited in
(71)- Combinatorial optimization in system configuration design
- Variable neighbourhood search: Methods and applications
- Graph coloring by multiagent fusion search
- A search space ``cartography for guiding graph coloring heuristics
- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
- A memetic algorithm for graph coloring
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Local optima topology for the \(k\)-coloring problem
- A clique covering MIP model for the irregular strip packing problem
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Coloring large graphs based on independent set extraction
- An effective heuristic algorithm for sum coloring of graphs
- Tabu search for the BWC problem
- A note on computational approaches for the antibandwidth problem
- An incremental search heuristic for coloring vertices of a graph
- Reinforcement learning based tabu search for the minimum load coloring problem
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry
- Adaptive feasible and infeasible tabu search for weighted vertex coloring
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- On edge orienting methods for graph coloring
- Local 7-coloring for planar subgraphs of unit disk graphs
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- CHECKCOL: improved local search for graph coloring
- Generalised graph colouring by a hybrid of local search and constraint programming
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Efficient algorithms for finding critical subgraphs
- An adaptive memory algorithm for the k-coloring problem
- Optimisation of gravity-fed water distribution network design: a critical review
- Iterated local search with tabu search for the weighted vertex coloring problem
- A new approach to the vertex coloring problem
- A graph coloring approach to the deployment scheduling and unit assignment problem
- Informed reactive tabu search for graph coloring
- An extraction and expansion approach for graph coloring
- A Wide Branching Strategy for the Graph Coloring Problem
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
- A survey on vertex coloring problems
- Inverse chromatic number problems in interval and permutation graphs
- A tabu search heuristic for the equitable coloring problem
- An exact algorithm with learning for the graph coloring problem
- Exploring the role of graph spectra in graph coloring algorithm performance
- Heuristics for a project management problem with incompatibility and assignment costs
- Quantum annealing of the graph coloring problem
- scientific article; zbMATH DE number 2079895 (Why is no real title available?)
- The \(k\)-coloring fitness landscape
- Vehicle sequencing at transshipment terminals with handover relations
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
- Hybrid evolutionary algorithm for the b-chromatic number
- FWLS: a local search for graph coloring
- scientific article; zbMATH DE number 956852 (Why is no real title available?)
- Using tabu search techniques for graph coloring
- Local search algorithms for the composite retrieval problem
- A supernodal formulation of vertex colouring with applications in course timetabling
- Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem
- Expected polynomial-time randomized algorithm for graph coloring problem
- A fresh look at a randomized massively parallel graph coloring algorithm
- An improved bi-criteria evolutionary approach for the sum coloring of graphs
- On solution discovery via reconfiguration
- An improved bi-criteria evolutionary approach for the sum coloring of graphs
- Technique for transforming discrete optimization problems into QUBO form
- Consistent neighborhood search for combinatorial optimization
- Improving the extraction and expansion method for large graph coloring
- A near-real-time reduction-based algorithm for coloring massive graphs
- Graph colouring approaches for a satellite range scheduling problem
- A cooperative search method for the \(k\)-coloring problem
- A sequential elimination algorithm for computing bounds on the clique number of a graph
- Variable space search for graph coloring
- About equivalent interval colorings of weighted graphs
- Variable neighbourhood search: methods and applications
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
This page was built for publication: A survey of local search methods for graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489304)
