2 papers
cs.DS2017
Using Matching to Detect Infeasibility of Some Integer Programs
S. J. Gismondi, E. R. Swart
A novel matching based heuristic algorithm designed to detect specially formulated infeasible zero-one IPs is presented. The algorithm input is a set of nested doubly stochastic su…
cs.DS2016
Deciding Graph non-Hamiltonicity via a Closure Algorithm
E. R. Swart, S. J. Gismondi, N. R. Swart +2
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the Hamilton cycles in a complete directed graph on vertices corresp…