Zhenxuan Xie

A Swap Relaxation-Based Local Search for the Latin Square Completion Problem

The Latin square completion (LSC) problem aims to assign n symbols to the empty cells of a partially filled Latin square such that in each row and each column, each symbol appears exactly once. In this paper, we propose a swap relaxation-based fast local search algorithm called SRLS for solving the…