Serguei Rossomakhine

According to our database, Serguei Rossomakhine authored at least 6 papers between 2014 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2018

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

Pouya Baniasadi, Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine

CoRR, 2018

A note on using the resistance-distance matrix to solve Hamiltonian cycle problem.

Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, John F. Roddick, Serguei Rossomakhine

Ann. Oper. Res., 2018

2017

Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem.

Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine

CoRR, 2017

2015

A new heuristic for detecting non-Hamiltonicity in cubic graphs.

Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine

Comput. Oper. Res., 2015

A linear-size conversion of HCP to 3HCP.

Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine

Australas. J Comb., 2015

2014

Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian cycle problem.

Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine

Math. Program. Comput., 2014