Changxing Dong

According to our database, Changxing Dong authored at least 5 papers between 2007 and 2014.

Collaborative distances:

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

2014

A backbone based TSP heuristic for large instances.

Gerold Jäger, Changxing Dong, Boris Goldengorin, Paul Molitor, Dirk Richter

J. Heuristics, 2014

2010

Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction.

Christian Ernst, Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009

Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones.

Changxing Dong, Christian Ernst, Gerold Jäger, Dirk Richter, Paul Molitor

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges.

Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2007

What Graphs can be Efficiently Represented by BDDs?

Changxing Dong, Paul Molitor

Proceedings of the 2007 International Conference on Computing: Theory and Applications (ICCTA 2007), 2007