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)- 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
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
- A tabu search approach for the sum coloring problem
- Graph coloring by multiagent fusion search
- A variable neighborhood search for graph coloring.
- A semidefinite programming-based heuristic for graph coloring
- Quantum annealing of the graph coloring problem
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- A parallel tabu search algorithm for large traveling salesman problems
- An effective hybrid algorithm for university course timetabling
- A survey of local search methods for graph coloring
- An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
- On the recursive largest first algorithm for graph colouring
- Circular coloring of graphs via linear programming and tabu search
- A memetic algorithm for graph coloring
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- Lower bounds for the minimal sum coloring problem
- Local optima topology for the \(k\)-coloring problem
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- A user's guide to tabu search
- An efficient tabu search procedure for the \(p\)-median problem
- Location and sizing of offshore platforms for oil exploration
- Consistent neighborhood search for combinatorial optimization
- 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
- A comparison of neighborhood search techniques for multi-objective combinatorial problems
- A tabu search algorithm for the routing and capacity assignment problem in computer networks
- Hybrid evolutionary algorithm for the b-chromatic number
- New secure partial encryption method for medical images using graph coloring problem
- Another look at graph coloring via propositional satisfiability
- Tabu search for graph partitioning
- Exchanges procedures for timetabling problems
- A memetic algorithm for the minimum sum coloring problem
- Tabu search with simple ejection chains for coloring graphs
- A mathematical model and a metaheuristic approach for a memory allocation problem
- Genetic algorithms and tabu search: Hybrids for optimization
- General local search methods
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- Simulated annealing: A tool for operational research
- 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?)
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)
