research
∙
10/11/2021
Binary Programming Formulations for the Upper Domination Problem
We consider Upper Domination, the problem of finding the minimal dominat...
share
research
∙
11/06/2019
An improved binary programming formulation for the secure domination problem
The secure domination problem, a variation of the domination problem wit...
research
∙
02/27/2019
A Linearly-growing Conversion from the Set Splitting Problem to the Directed Hamiltonian Cycle Problem
We consider a direct conversion of the, classical, set splitting problem...
research
∙
02/27/2019
FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem
The FHCP Challenge Set, comprising of 1001 instances of Hamiltonian cycl...
research
∙
02/27/2019
Linearly-growing Reductions of Karp's 21 NP-complete Problems
We address the question of whether it may be worthwhile to convert certa...
research
∙
02/27/2019
Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian Cycle Problem
We present a polynomial complexity, deterministic, heuristic for solving...
research
∙
06/25/2018
A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem
We present a benchmark set for Traveling salesman problem (TSP) with cha...
research
∙
04/26/2018
