Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Volume 52 (2020)
Volume 51 (2019)
Volume 50 (2018)
Volume 49 (2017)
Volume 48 (2016)
Volume 47 (2016)
Volume 46 (2015)
Volume 45 (2014)
Volume 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)
Deciding Graph non-Hamiltonicity via a Closure Algorithm

E. R. Swart; Stephen J. Gismondi; N. R. Swart; C. E. Bell; A. Lee

Volume 48, Issue 1 , December 2016, , Pages 1-35

https://doi.org/10.22059/jac.2016.7937

Abstract
  We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, ...  Read More

Modelling Decision Problems Via Birkhoff Polyhedra

Stephen J. Gismondi

Volume 44, Issue 1 , December 2013, , Pages 61-81

https://doi.org/10.22059/jac.2013.7915

Abstract
  A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are ...  Read More