Zobrazeno 1 - 10
of 383
pro vyhledávání: '"Filar, Jerzy"'
Environmental scientists frequently rely on time series of explanatory variables to explain their impact on an important response variable. However, sometimes, researchers are less interested in raw observations of an explanatory variable than in der
Externí odkaz:
http://arxiv.org/abs/2303.16073
Publikováno v:
In Mathematical Biosciences January 2024 367
We consider the problem of sensitivity of threshold risk, defined as the probability of a function of a random variable falling below a specified threshold level $\delta >0.$ We demonstrate that for polynomial and rational functions of that random va
Externí odkaz:
http://arxiv.org/abs/2008.12440
Autor:
Filar, Jerzy, Streipert, Sabrina
We introduce the term net-proliferation in the context of fisheries and establish relations between the proliferation and net-proliferation that are economically and sustainably favored. The resulting square root laws are analytically derived for spe
Externí odkaz:
http://arxiv.org/abs/2005.00913
Publikováno v:
Annals of Operations Research, 261(1-2):393-399, 2018
An instance of Hamiltonian cycle problem can be solved by converting it to an instance of Travelling salesman problem, assigning any choice of weights to edges of the underlying graph. In this note we demonstrate that, for difficult instances, choosi
Externí odkaz:
http://arxiv.org/abs/1902.10356
Publikováno v:
Journal of Global Optimization, 56(4):1425-1440, 2013
We present an algorithm to find the determinant and its first and second derivatives of a rank-one corrected generator matrix of a doubly stochastic Markov chain. The motivation arises from the fact that the global minimiser of this determinant solve
Externí odkaz:
http://arxiv.org/abs/1902.10348
Publikováno v:
Numerical Algebra, Control and Optimization, 8(1):1-16, 2018
We address the question of whether it may be worthwhile to convert certain, now classical, NP-complete problems to one of a smaller number of kernel NP-complete problems. In particular, we show that Karp's classical set of 21 NP-complete problems con
Externí odkaz:
http://arxiv.org/abs/1902.10349
Autor:
Haythorpe, Michael, Filar, Jerzy
We consider a direct conversion of the, classical, set splitting problem to the directed Hamiltonian cycle problem. A constructive procedure for such a conversion is given, and it is shown that the input size of the converted instance is a linear fun
Externí odkaz:
http://arxiv.org/abs/1902.10354
Publikováno v:
Computers and Operations Research, 64:283-292, 2015
We analyse a polyhedron which contains the convex hull of all Hamiltonian cycles of a given undirected connected cubic graph. Our constructed polyhedron is defined by polynomially-many linear constraints in polynomially-many continuous (relaxed) vari
Externí odkaz:
http://arxiv.org/abs/1902.10342
Publikováno v:
Mathematical Programming Computation 6(1), 55-75, 2014
We present a polynomial complexity, deterministic, heuristic for solving the Hamiltonian Cycle Problem (HCP) in an undirected graph of order $n$. Although finding a Hamiltonian cycle is not theoretically guaranteed, we have observed that the heuristi
Externí odkaz:
http://arxiv.org/abs/1902.10337