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)- Tabu search with simple ejection chains for coloring graphs
- Another look at graph coloring via propositional satisfiability
- A branch-and-cut algorithm for graph coloring
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- 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
- About equivalent interval colorings of weighted graphs
- Applying tabu search to determine new Ramsey 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
- 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
- Tabu search techniques. A tutorial and an application to neural networks
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A survey on vertex coloring problems
- Efficient algorithms for finding critical subgraphs
- An improved ant colony optimisation heuristic for graph colouring
- Tabu search for graph partitioning
- Adaptive memory programming: a unified view of metaheuristics
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- Metaheuristics: A bibliography
- 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
- 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
- Genetic algorithms and tabu search: Hybrids for optimization
- Coloring large graphs based on independent set extraction
- CHECKCOL: improved local search for graph coloring
- Local optima topology for the \(k\)-coloring problem
- Informed reactive tabu search for graph coloring
- A hybrid heuristic for the maximum dispersion problem
- 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
- Hybrid evolutionary algorithm for the b-chromatic number
- An incremental search heuristic for coloring vertices of a graph
- 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
- 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
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- 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
- Consistent neighborhood search for combinatorial optimization
- Common due-date determination and sequencing using tabu search
- Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
- 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
- scientific article; zbMATH DE number 1488073 (Why is no real title available?)
- 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 memetic algorithm for deinterleaving pulse trains
- Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
- Simulated annealing: An introduction
- Heuristics from Nature for Hard Combinatorial Optimization Problems
- Heuristics for a project management problem with incompatibility and assignment costs
- An exact approach for the vertex coloring 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
- 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
- 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
- A tabu search heuristic for the equitable coloring problem
- Optimizing tabu list size for the traveling salesman problem
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- An effective hybrid algorithm for university course timetabling
- Artificial life techniques for load balancing in computational grids
- A search space ``cartography for guiding graph coloring heuristics
- Circular coloring of graphs via linear programming and tabu search
- Solution techniques for the large set covering problem
- Genetic and hybrid algorithms for graph coloring
- A memetic algorithm for the minimum sum coloring problem
- Algoritmo de búsqueda tabú para una variante del problema de coloración
- Finding a feasible course schedule using Tabu search
- Adaptive feasible and infeasible tabu search for weighted vertex coloring
- Parallel Immune System for Graph Coloring
- A tabu search algorithm for the routing and capacity assignment problem in computer networks
- A tabu search algorithm for structural software testing
- scientific article; zbMATH DE number 597813 (Why is no real title available?)
- A comparison of neighborhood search techniques for multi-objective combinatorial problems
- Online algorithms for the maximum \(k\)-colorable subgraph problem
- A systematic study on meta-heuristic approaches for solving the graph coloring problem
- General local search methods
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)
