Jun Han

According to our database, Jun Han authored at least 4 papers between 2000 and 2003.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of six.

2003

A Node-oriented Branch and Bound Algorithm for the Capacitated Minimum Spanning Tree Problem.

Jun Han, Graham McMahon, Stephen Sugden

Proceedings of the 28th Annual IEEE Conference on Local Computer Networks (LCN 2003), 2003

2002

A Branch and Bound Algorithm for Minimum Cost Network Flow Problem.

Jun Han, Graham McMahon, Stephen Sugden

Proceedings of the Intelligent Data Engineering and Automated Learning, 2002

A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem (Research Note).

Jun Han, Graham McMahon, Stephen Sugden

Proceedings of the Euro-Par 2002, 2002

2000

A model for nonlinear cost problems in optimal design of communication networks.

Jun Han, Graham McMahon, Stephen Sugden

Proceedings of the Proceedings Ninth International Conference on Computer Communications and Networks, 2000