Related papers: An Efficient Local Search for Partial Latin Square…
The partial Latin square extension problem is to fill as many as possible empty cells of a partially filled Latin square. This problem is a useful model for a wide range of applications in diverse domains. This paper presents the first…
Large Neighborhood Search (LNS) is a common heuristic in combinatorial optimization that iteratively searches over a large neighborhood of the current solution for a better one. Recently, neural network-based LNS solvers have achieved great…
A classical question in combinatorics is the following: given a partial latin square P, when can we complete P to a latin square L? In this paper, we will investigate the class of \leq\epsilon-dense partial latin squares: partial latin…
Large Neighborhood Search (LNS) is a popular heuristic algorithm for solving combinatorial optimization problems (COP). It starts with an initial solution to the problem and iteratively improves it by searching a large neighborhood around…
The class PLS (Polynomial Local Search) captures the complexity of finding a solution that is locally optimal and has proven to be an important concept in the theory of local search. It has been shown that local search versions of various…
The partial least squares (PLS) is a popular modeling technique commonly used in social sciences. The traditional PLS algorithm deals with variables measured on interval scales while data are often collected on ordinal scales: a…
The Nearest Neighbor Search (NNS) problem asks to design a data structure that preprocesses an $n$-point dataset $X$ lying in a metric space $\mathcal{M}$, so that given a query point $q \in \mathcal{M}$, one can quickly return a point of…
We present new refinement heuristics for the balanced graph partitioning problem that break with an age-old rule. Traditionally, local search only permits moves that keep the block sizes balanced (below a size constraint). In this work, we…
A Latin square of order $n$ is an $n\times n$ matrix in which each row and column contains each of $n$ symbols exactly once. For $\epsilon>0$, we show that with high probability a uniformly random Latin square of order $n$ has no proper…
For Latin squares the units (rows and columns) have fixed sum. The same holds for rows, columns, and blocks in Sudokus. Summing the elements of a unit yields a linear equation, and the set of all such equations forms a system of linear…
The problem of completing a partially specified n by n Latin square is solved by an alternative proof, based on filling the rows (or diagonals) from 1 to n, using an extended form of Hall's marriage theorem.
We propose an innovative Parallel Quantum Local Search (PQLS) methodology that leverages the capabilities of small-scale quantum computers to efficiently address complex combinatorial optimization problems. Traditional Quantum Local Search…
Pareto Local Search (PLS) is a basic building block in many metaheuristics for Multiobjective Combinatorial Optimization Problem (MCOP). In this paper, an enhanced PLS variant called Parallel Pareto Local Search based on Decomposition…
Latin squares are interesting combinatorial objects with many applications. When working with Latin squares, one is sometimes led to deal with partial Latin squares, a generalization of Latin squares. One of the problems regarding partial…
A classical question in combinatorics is the following:\ given a partial Latin square $P$, when can we complete $P$ to a Latin square $L$? In this paper, we investigate the class of \textbf{$\epsilon$-dense partial Latin squares}:\ partial…
Near neighbor problems are fundamental in algorithms for high-dimensional Euclidean spaces. While classical approaches suffer from the curse of dimensionality, locality sensitive hashing (LSH) can effectively solve a-approximate r-near…
An $n \times n$ partial Latin square $P$ is called $\alpha$-dense if each row and column has at most $\alpha n$ non-empty cells and each symbol occurs at most $\alpha n$ times in $P$. An $n \times n$ array $A$ where each cell contains a…
In this paper, we study the complexity of computing locally optimal solutions for weighted versions of standard set problems such as SetCover, SetPacking, and many more. For our investigation, we use the framework of PLS, as defined in…
Local search algorithms use the neighborhood relations among search states and often perform well for a variety of NP-hard combinatorial search problems. This paper shows how quantum computers can also use these neighborhood relations. An…
The $c$-approximate Near Neighbor problem in high dimensional spaces has been mainly addressed by Locality Sensitive Hashing (LSH), which offers polynomial dependence on the dimension, query time sublinear in the size of the dataset, and…