What Graphs can be Efficiently Represented by BDDs? - Changxing Dong; Paul Molitor (ICCTA, 2007)

Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. - Changxing Dong; Gerold Jäger; Dirk Richter; Paul Molitor (AAIM, 2009)

Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones. - Changxing Dong; Christian Ernst; Gerold Jäger; Dirk Richter; Paul Molitor (CTW, 2009)

Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction. - Christian Ernst; Changxing Dong; Gerold Jäger; Dirk Richter; Paul Molitor (AAIM, 2010)

A backbone based TSP heuristic for large instances. - Gerold Jäger; Changxing Dong; Boris Goldengorin; Paul Molitor; Dirk Richter (J. Heuristics, 2014)