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

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

collaborators
Showing math.COShow all

2 papers · 1 filter

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…

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…