A graph coloring heuristic using partial solutions and a reactive tabu scheme
From MaRDI portal
Publication:2456655
DOI10.1016/j.cor.2006.05.014zbMath1278.90327OpenAlexW2024143101MaRDI QIDQ2456655
Ivo Blöchliger, Nicolas Zufferey
Publication date: 19 October 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.05.014
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Three tabu search methods for the MI-FAP applied to 802.11 networks, Graph colouring approaches for a satellite range scheduling problem, Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, Towards objective measures of algorithm performance across instance space, High-performance technique for satellite range scheduling, A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem, A Tabu Search Heuristic for the Equitable Coloring Problem, Simple decentralized graph coloring, Exploring the role of graph spectra in graph coloring algorithm performance, A massively parallel evolutionary algorithm for the partial Latin square extension problem, Heuristics for a project management problem with incompatibility and assignment costs, An exact approach for the vertex coloring problem, Quantum annealing of the graph coloring problem, Metaheuristics for truck loading in the car production industry, A new ant colony optimization algorithm for the lower bound of sum coloring problem, A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems, Multi-coloring and job-scheduling with assignment and incompatibility costs, Graph Coloring Models and Metaheuristics for Packing Applications, An efficient local search for the feedback vertex set problem, A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic, Variable space search for graph coloring, Improved local search approaches to solve the post enrolment course timetabling problem, Hybrid evolutionary algorithm for the b-chromatic number, Optimization by ant algorithms: possible roles for an individual ant, Consistent neighborhood search for combinatorial optimization, A wide-ranging computational comparison of high-performance graph colouring algorithms, An evolutionary approach for bandwidth multicoloring problems, Coloring large graphs based on independent set extraction, A new \textsf{DSATUR}-based algorithm for exact vertex coloring, An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring, Improving the extraction and expansion method for large graph coloring, Tackling the maximum happy vertices problem in large networks, The maximum happy induced subgraph problem: bounds and algorithms, A NEW APPROACH TO THE VERTEX COLORING PROBLEM, Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach, A search space ``cartography for guiding graph coloring heuristics, A memetic algorithm for graph coloring, A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems, INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING, AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- Some experiments with simulated annealing for coloring graphs
- A variable neighborhood search for graph coloring.
- Genetic and hybrid algorithms for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- An adaptive memory algorithm for the \(k\)-coloring problem
- A Metaheuristic Approach for the Vertex 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
- Tabu Search—Part II
- New methods to color the vertices of a graph
- The Reactive Tabu Search
- A Column Generation Approach for Graph Coloring
- Models and solution techniques for frequency assignment problems
- A GRASP for coloring sparse graphs
