A survey of local search methods for graph coloring
From MaRDI portal
Publication:2489304
DOI10.1016/j.cor.2005.07.028zbMath1086.90060OpenAlexW2093938881MaRDI QIDQ2489304
Alain Hertz, Philippe Galinier
Publication date: 16 May 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.07.028
Related Items
A graph coloring approach to the deployment scheduling and unit assignment problem, Graph colouring approaches for a satellite range scheduling problem, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, Inverse chromatic number problems in interval and permutation graphs, Reinforcement learning based tabu search for the minimum load coloring problem, On edge orienting methods for graph coloring, An exact algorithm with learning for the graph coloring problem, A clique covering MIP model for the irregular strip packing problem, A Tabu Search Heuristic for the Equitable Coloring Problem, SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning, Iterated local search with tabu search for the weighted vertex coloring problem, A Wide Branching Strategy for the Graph Coloring Problem, A supernodal formulation of vertex colouring with applications in course timetabling, Grouping products for the optimization of production processes: a case in the steel manufacturing industry, Exploring the role of graph spectra in graph coloring algorithm performance, Local search algorithms for the composite retrieval problem, Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem, Local 7-coloring for planar subgraphs of unit disk graphs, Adaptive feasible and infeasible tabu search for weighted vertex coloring, Heuristics for a project management problem with incompatibility and assignment costs, Quantum annealing of the graph coloring problem, A cooperative search method for the \(k\)-coloring problem, A sequential elimination algorithm for computing bounds on the clique number of a graph, The \(k\)-coloring fitness landscape, A survey on vertex coloring problems, Efficient algorithms for finding critical subgraphs, An adaptive memory algorithm for the \(k\)-coloring problem, Variable space search for graph coloring, Hybrid evolutionary algorithm for the b-chromatic number, Consistent neighborhood search for combinatorial optimization, 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, 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, Improving the extraction and expansion method for large graph coloring, A NEW APPROACH TO THE VERTEX COLORING PROBLEM, On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics, A note on computational approaches for the antibandwidth problem, An incremental search heuristic for coloring vertices of a graph, 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, Vehicle Sequencing at Transshipment Terminals with Handover Relations, On a parallel genetic-tabu search based algorithm for solving the graph colouring problem, A memetic algorithm for graph coloring, INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING, AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING, Optimisation of gravity-fed water distribution network design: a critical review
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Using tabu search techniques for graph coloring
- Some experiments with simulated annealing for coloring graphs
- An introduction to timetabling
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Variable neighborhood search
- A variable neighborhood search for graph coloring.
- Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
- Future paths for integer programming and links to artificial intelligence
- Genetic and hybrid algorithms for graph coloring
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- Probabilistic diversification and intensification in local search for vehicle routing
- Hybrid evolutionary algorithms for graph coloring
- An adaptive memory algorithm for the \(k\)-coloring problem
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Tabu Search—Part I
- An application of graph coloring to printed circuit testing
- New methods to color the vertices of a graph
- Unnamed Item
