Results 1 to 10 of about 267,416 (163)
The n-queens completion problem. [PDF]
Res Math Sci, 2022 AbstractAn n-queens configuration is a placement of n mutually non-attacking queens on an $$n\times n$$ n × n chessboard. The n-queens completion problem, introduced by Nauck in 1850, is to decide whether a given partial configuration can ...
Glock S, Munhá Correia D, Sudakov B.
europepmc +6 more sources
The Totally Positive Completion Problem: The 3-by-n Case
Special Matrices, 2021 The 3-by-n TP-completable patterns are characterized by identifying the minimal obstructions up to natural symmetries. They are finite in number.
Carter D. +4 more
doaj +2 more sources
The CP-Matrix Completion Problem [PDF]
SIAM Journal on Matrix Analysis and Applications, 2014 arXiv admin note: text overlap with arXiv:1210.6930 by other ...
Anwa Zhou, Jinyan Fan
exaly +3 more sources
Mathematics, 2023 We propose a vehicle routing problem with time windows (VRPTW) with compatibility-matching constraints and total completion time as the objective function, with applications in home healthcare routing and scheduling.
Payakorn Saksuriya, Chulin Likasiri
doaj +3 more sources
Linear Algebra and Its Applications, 2003 An \(n \times n\) matrix is called an \(N\)-matrix if all principal minors are negative. The authors prove that a combinatorially symmetric partial \(N\)-matrix has an \(N\)-matrix completion if the graph of its specified entries is a 1-chordal graph.
Ana Maria Urbano, Juan R Torregrosa
exaly +4 more sources
The Q0-matrix completion problem [PDF]
Arab Journal of Mathematical Sciences, 2021 A matrix is a Q0-matrix if for every k∈{1,2,…,n}, the sum of all k×k principal minors is nonnegative. In this paper, we study some necessary and sufficient conditions for a digraph to have Q0-completion. Later on we discuss the relationship between Q and
Kalyan Sinha
doaj +1 more source
Numerical Treatment of a Data Completion Problem in Heat Conduction Modelling [PDF]
Journal of Universal Computer Science, 2020 This work deals with a question in the mathematical modelling for the temperature evolution in a bar, for a long time linked as an inverse problem. The onedimensional model is the parabolic partial differential equation ut = α uxx, known as the heat ...
Augusto C. de Castro Barbosa +3 more
doaj +3 more sources
Completion and deficiency problems [PDF]
Journal of Combinatorial Theory, Series B, 2020 Given a partial Steiner triple system (STS) of order $n$, what is the order of the smallest complete STS it can be embedded into? The study of this question goes back more than 40 years. In this paper we answer it for relatively sparse STSs, showing that given a partial STS of order $n$ with at most $r \le \varepsilon n^2$ triples, it can always be ...
Rajko Nenadov +2 more
openaire +4 more sources
Completion of the Causal Completability Problem [PDF]
The British Journal for the Philosophy of Science, 2015 We give a few results concerning the notions of causal completability and causal closedness of classical probability spaces (Hofer-Szabo, Redei & Szabo [1999], Gyenis & Redei [2004]). Answering a question from Hofer-Szabo et al. [1999], we prove that any classical probability space has a causally closed extension. We also employ the notion of causal up-
Wroński, Leszek, Marczyk, Michał
openaire +2 more sources
A parallel multi‐block alternating direction method of multipliers for tensor completion
IET Image Processing, 2021 This paper proposes an algorithm for the tensor completion problem of estimating multi‐linear data under the limitation of observation rate. Many tensor completion methods are based on nuclear norm minimization, they may fail to achieve the global ...
Hu Zhu +5 more
doaj +1 more source