Using tabu search techniques for graph coloring
From MaRDI portal
(Redirected from Publication:580987)
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits
- Algoritmo de búsqueda tabú para una variante del problema de coloración
- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
- A memetic algorithm for deinterleaving pulse trains
- Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- Parallel Immune System for Graph Coloring
- An extraction and expansion approach for graph coloring
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- EPCOT: An efficient procedure for coloring optimally with Tabu Search
- Part type selection problem in flexible manufacturing systems: Tabu search algorithms
- 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
- Three tabu search methods for the MI-FAP applied to 802.11 networks
- scientific article; zbMATH DE number 597813 (Why is no real title available?)
- A new approach to the vertex coloring problem
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
- Optimizing tabu list size for the traveling salesman problem
- 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
- Chromatic scheduling and frequency assignment
- Combinatorial optimization in system configuration design
- Iterative coloring extension of a maximum clique
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- Online algorithms for the maximum \(k\)-colorable subgraph problem
- Tabu search for the BWC problem
- Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search
- Solution techniques for the large set covering problem
- Applying tabu search to determine new Ramsey graphs
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
- Simple decentralized graph coloring
- A systematic study on meta-heuristic approaches for solving the graph coloring problem
- Adaptive feasible and infeasible tabu search for weighted vertex coloring
- A massively parallel evolutionary algorithm for the partial Latin square extension problem
- Improving the extraction and expansion method for large graph coloring
- A memetic algorithm with adaptive operator selection for graph coloring
- COSINE: A new graph coloring algorithm
- An incremental search heuristic for coloring vertices of a graph
- Simulated annealing: An introduction
- A tabu search algorithm for structural software testing
- CHECKCOL: improved local search for graph coloring
- A sequential elimination algorithm for computing bounds on the clique number of a graph
- Heuristics from Nature for Hard Combinatorial Optimization Problems
- Graph coloring models and metaheuristics for packing applications
- Common due-date determination and sequencing using tabu search
- A tabu search heuristic for the equitable coloring problem
- Informed reactive tabu search for graph coloring
- The life span method -- a new variant of local search
- scientific article; zbMATH DE number 1488073 (Why is no real title available?)
- Driving tabu search with case-based reasoning
- A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
- A cooperative search method for the \(k\)-coloring problem
- Optimizing the system of virtual paths by tabu search.
- A branch-and-cut algorithm for graph coloring
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- An adaptive memory algorithm for the \(k\)-coloring problem
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Tabu search for large scale timetabling problems
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- Using tabu search with longer-term memory and relaxation to create examination timetables.
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
- Solving the maximum clique problem using a tabu search approach
- Tabu search techniques. A tutorial and an application to neural networks
- Adaptive memory programming: a unified view of metaheuristics
- A hybrid heuristic for the maximum dispersion problem
- An exact method for graph coloring
- On the use of some known methods for \(T\)-colorings of graphs
- Exact solution of graph coloring problems via constraint programming and column generation
- A survey on vertex coloring problems
- An efficient memetic algorithm for the graph partitioning problem
- An ant-based algorithm for coloring graphs
- Heuristics for a project management problem with incompatibility and assignment costs
- Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
- A new extension of local search applied to the Dial-A-Ride problem
- Coloring large graphs based on independent set extraction
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Variable space search for graph coloring
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
- Metaheuristics: A bibliography
- About equivalent interval colorings of weighted graphs
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Using local search to speed up filtering algorithms for some NP-hard constraints
- Exploring the role of graph spectra in graph coloring algorithm performance
- An exact approach for the vertex coloring problem
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Artificial life techniques for load balancing in computational grids
- A search space ``cartography for guiding graph coloring heuristics
- Efficient algorithms for finding critical subgraphs
- Finding a feasible course schedule using Tabu search
- Heuristics for biquadratic assignment problems and their computational comparison
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- Graph colouring approaches for a satellite range scheduling problem
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- Genetic and hybrid algorithms for graph coloring
- An improved ant colony optimisation heuristic for graph colouring
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
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)
