Using tabu search techniques for graph coloring
From MaRDI portal
DOI10.1007/BF02239976zbMATH Open0626.68051OpenAlexW2168000780MaRDI QIDQ580987FDOQ580987
Authors: Dominique De Werra, Alain Hertz 
Publication date: 1987
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02239976
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Cites Work
Cited In (only showing first 100 items - show all)
- A user's guide to tabu search
- An adaptive memory algorithm for the \(k\)-coloring problem
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- An exact method for graph coloring
- Exact solution of graph coloring problems via constraint programming and column generation
- On the use of some known methods for \(T\)-colorings of graphs
- Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
- Consistent neighborhood search for combinatorial optimization
- An efficient memetic algorithm for the graph partitioning problem
- Using local search to speed up filtering algorithms for some NP-hard constraints
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- A tabu search approach for the sum coloring problem
- Lower bounds for the minimal sum coloring problem
- A variable neighborhood search for graph coloring.
- A semidefinite programming-based heuristic for graph coloring
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
- Heuristics for a project management problem with incompatibility and assignment costs
- An exact approach for the vertex coloring problem
- On the recursive largest first algorithm for graph colouring
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- An efficient tabu search procedure for the \(p\)-median problem
- A mathematical model and a metaheuristic approach for a memory allocation problem
- Tabu search for large scale timetabling problems
- Artificial life techniques for load balancing in computational grids
- An effective hybrid algorithm for university course timetabling
- A search space ``cartography for guiding graph coloring heuristics
- Genetic and hybrid algorithms for graph coloring
- Circular coloring of graphs via linear programming and tabu search
- A memetic algorithm for the minimum sum coloring problem
- Finding a feasible course schedule using Tabu search
- A tabu search algorithm for the routing and capacity assignment problem in computer networks
- A comparison of neighborhood search techniques for multi-objective combinatorial problems
- General local search methods
- Graph coloring by multiagent fusion search
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- A survey of local search methods for graph coloring
- A memetic algorithm for graph coloring
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- A new extension of local search applied to the Dial-A-Ride problem
- Heuristics for biquadratic assignment problems and their computational comparison
- An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
- New secure partial encryption method for medical images using graph coloring problem
- Exchanges procedures for timetabling problems
- Exploring the role of graph spectra in graph coloring algorithm performance
- Quantum annealing of the graph coloring problem
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
- An ant-based algorithm for coloring graphs
- Variable space search for graph coloring
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- The tabu search metaheuristic: How we used it
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Optimizing the system of virtual paths by tabu search.
- Using tabu search with longer-term memory and relaxation to create examination timetables.
- Graph colouring approaches for a satellite range scheduling problem
- Another look at graph coloring via propositional satisfiability
- Tabu search with simple ejection chains for coloring graphs
- Simulated annealing: A tool for operational research
- A branch-and-cut algorithm for graph coloring
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- About equivalent interval colorings of weighted graphs
- Location and sizing of offshore platforms for oil exploration
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- A parallel tabu search algorithm for large traveling salesman problems
- Adaptive memory programming: a unified view of metaheuristics
- Tabu search techniques. A tutorial and an application to neural networks
- A survey on vertex coloring problems
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Efficient algorithms for finding critical subgraphs
- An improved ant colony optimisation heuristic for graph colouring
- Tabu search for graph partitioning
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Solving the maximum clique problem using a tabu search approach
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Metaheuristics: A bibliography
- Genetic algorithms and tabu search: Hybrids for optimization
- Coloring large graphs based on independent set extraction
- Local optima topology for the \(k\)-coloring problem
- A hybrid heuristic for the maximum dispersion problem
- Hybrid evolutionary algorithm for the b-chromatic number
- Expected polynomial-time randomized algorithm for graph coloring problem
- Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context
- Modelling constant weight codes using tabu search
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- Common due-date determination and sequencing using tabu search
- Title not available (Why is that?)
- A memetic algorithm for deinterleaving pulse trains
- Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring
- Simulated annealing: An introduction
- Heuristics from Nature for Hard Combinatorial Optimization Problems
- Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
- An extraction and expansion approach for graph coloring
- Improving the extraction and expansion method for large graph coloring
- The life span method -- a new variant of local search
This page was built for publication: Using tabu search techniques for graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580987)
