3 papers
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
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.CO2012
Genetic Theory for Cubic Graphs
Pouya Baniasadi, Vladimir Ejov, Jerzy Filar +1
We propose a partitioning of the set of unlabelled, connected cubic graphs into two disjoint subsets named genes and descendants, where the cardinality of the descendants is much l…