Using tabu search techniques for graph coloring

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

05-04: Software, source code, etc. for problems pertaining to combinatorics

Related Items

Iterative coloring extension of a maximum clique, Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints, Parallel Immune System for Graph Coloring, On the recursive largest first algorithm for graph colouring, Heuristics from Nature for Hard Combinatorial Optimization Problems, Optimizing the system of virtual paths by tabu search., Adaptive memory programming: a unified view of metaheuristics, Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP, TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph, Tabu search for large scale timetabling problems, Graph colouring approaches for a satellite range scheduling problem, Solution techniques for the large set covering problem, Semidefinite programming relaxations for graph coloring and maximal clique problems, A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding, An effective hybrid algorithm for university course timetabling, Simulated annealing: A tool for operational research, 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, An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring, A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing, Combinatorial optimization in system configuration design, 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, New approaches for heuristic search: A bilateral linkage with artificial intelligence, Tabu search techniques. A tutorial and an application to neural networks, COSINE: A new graph coloring algorithm, Exchanges procedures for timetabling problems, Finding a feasible course schedule using Tabu search, Location and sizing of offshore platforms for oil exploration, Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems, STABULUS: A technique for finding stable sets in large graphs with tabu search, Optimizing tabu list size for the traveling salesman problem, A simple tabu search method to solve the mixed-integer linear bilevel programming problem, General local search methods, The life span method -- a new variant of local search, An efficient tabu search procedure for the \(p\)-median problem, Driving tabu search with case-based reasoning, Chromatic scheduling and frequency assignment, Local optima topology for the \(k\)-coloring problem, A parallel tabu search algorithm for large traveling salesman problems, A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits, Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search, Genetic algorithms and tabu search: Hybrids for optimization, The tabu search metaheuristic: How we used it, Modelling constant weight codes using tabu search, Heuristics for biquadratic assignment problems and their computational comparison, A new extension of local search applied to the Dial-A-Ride problem, A variable neighborhood search for graph coloring., Using tabu search with longer-term memory and relaxation to create examination timetables., A tabu search algorithm for the routing and capacity assignment problem in computer networks, EPCOT: An efficient procedure for coloring optimally with Tabu Search, Common due-date determination and sequencing using tabu search, A comparison of neighborhood search techniques for multi-objective combinatorial problems, Diversification strategies in tabu search algorithms for the maximum clique problem, Tabu search for graph partitioning, Genetic and hybrid algorithms for graph coloring, Metaheuristics: A bibliography, Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs, A user's guide to tabu search, An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search, Part type selection problem in flexible manufacturing systems: Tabu search algorithms, On the use of some known methods for \(T\)-colorings of graphs, Solving the maximum clique problem using a tabu search approach, A graph coloring heuristic using partial solutions and a reactive tabu scheme, CHECKCOL: improved local search for graph coloring, Artificial life techniques for load balancing in computational grids, A semidefinite programming-based heuristic for graph coloring, An ant-based algorithm for coloring graphs, Coloring graphs by iterated local search traversing feasible and infeasible solutions, Another look at graph coloring via propositional satisfiability, Efficient algorithms for finding critical subgraphs, An adaptive memory algorithm for the \(k\)-coloring problem, An improved ant colony optimisation heuristic for graph colouring, A tabu search algorithm for structural software testing, Embedding a novel objective function in a two-phased local search for robust vertex coloring, An exact method for graph coloring, A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem, A survey of local search methods for graph coloring, A branch-and-cut algorithm for graph coloring, Three tabu search methods for the MI-FAP applied to 802.11 networks, Simulated annealing: An introduction

Cites Work