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)
- 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
- Driving tabu search with case-based reasoning
- A tabu search heuristic for the equitable coloring problem
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- Optimizing tabu list size for the traveling salesman problem
- Algoritmo de búsqueda tabú para una variante del problema de coloración
- Solution techniques for the large set covering problem
- Parallel Immune System for Graph Coloring
- Adaptive feasible and infeasible tabu search for weighted vertex coloring
- A tabu search algorithm for structural software testing
- Title not available (Why is that?)
- Online algorithms for the maximum \(k\)-colorable subgraph problem
- A systematic study on meta-heuristic approaches for solving the graph coloring problem
- Three tabu search methods for the MI-FAP applied to 802.11 networks
- Chromatic scheduling and frequency assignment
- Combinatorial optimization in system configuration design
- Part type selection problem in flexible manufacturing systems: Tabu search algorithms
- Tabu search for the BWC problem
- A memetic algorithm with adaptive operator selection for graph coloring
- COSINE: A new graph coloring algorithm
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search
- Simple decentralized graph coloring
- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
- Iterative coloring extension of a maximum clique
- Graph coloring models and metaheuristics for packing applications
- A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits
- EPCOT: An efficient procedure for coloring optimally with Tabu Search
- Applying tabu search to determine new Ramsey graphs
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
- A cooperative search method for the \(k\)-coloring problem
- A massively parallel evolutionary algorithm for the partial Latin square extension problem
- A new approach to the vertex coloring problem
- A sequential elimination algorithm for computing bounds on the clique number of a graph
- CHECKCOL: improved local search for graph coloring
- Informed reactive tabu search for graph coloring
- A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- An incremental search heuristic for coloring vertices of a graph
- 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
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)
