activity
20062020
most citedA new benchmark set for Traveling salesman problem and Hamiltonian cycle problem

6 citations · 7 across the 12 of their papers we have counts for

collaborators

13 papers

math.PR2020

Hidden Equations of Threshold Risk

Vladimir V. Ejov, Jerzy A. Filar, Zhihao Qiao

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 We demonstr…

math.OC2019

A Note on Using the Resistance-Distance Matrix to solve Hamiltonian Cycle Problem

Vladimir Ejov, Jerzy A Filar, Michael Haythorpe +2

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 gr…

math.CO2019

Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian Cycle Problem

Pouya Baniasadi, Vladimir Ejov, Jerzy A Filar +2

We present a polynomial complexity, deterministic, heuristic for solving the Hamiltonian Cycle Problem (HCP) in an undirected graph of order . Although finding a Hamiltonian cyc…

cs.DS2018★ 6 cited

A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem

Pouya Baniasadi, Vladimir Ejov, Michael Haythorpe +1

We present a benchmark set for Traveling salesman problem (TSP) with characteristics that are different from the existing benchmark sets. In particular, we focus on small instances…

math.OC2017

Ordered field property for zero-sum stochastic games

K. Avrachenkov, V. Ejov, J. A. Filar +1

We consider a finite state, finite action, zero-sum stochastic games with data defining the game lying in the ordered field of algebraic numbers. In both the discounted and the lim…

q-bio.PE2017

Evolutionary games under incompetence

Maria Kleshnina, Jerzy A. Filar, Vladimir Ejov +1

The adaptation process of a species to a new environment is a significant area of study in biology. As part of natural selection, adaptation is a mutation process which improves su…