A massively parallel evolutionary algorithm for the partial Latin square extension problem
From MaRDI portal
Publication:6106593
DOI10.1016/j.cor.2023.106284arXiv2103.10453MaRDI QIDQ6106593
Publication date: 3 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.10453
heuristicscombinatorial optimizationevolutionary searchparallel searchpartial graph coloringLatin square problems
Cites Work
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
- Using tabu search techniques for graph coloring
- An efficient algorithm for computing the distance between close partitions
- An improved approximation algorithm for the partial Latin square extension problem.
- The complexity of completing partial Latin squares
- Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations.
- A memetic algorithm for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- Adaptive feasible and infeasible tabu search for weighted vertex coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A Metaheuristic Approach for the Vertex Coloring Problem
- Embedding Incomplete Latin Squares
- Quasigroup Identities and Mendelsohn Designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A massively parallel evolutionary algorithm for the partial Latin square extension problem
