A model for nonlinear cost problems in optimal design of communication networks. - Jun Han 006; Graham McMahon; Stephen Sugden (ICCCN, 2000)

A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem (Research Note). - Jun Han 006; Graham McMahon; Stephen Sugden (Euro-Par, 2002)

A Branch and Bound Algorithm for Minimum Cost Network Flow Problem. - Jun Han 006; Graham McMahon; Stephen Sugden (IDEAL, 2002)

A Node-oriented Branch and Bound Algorithm for the Capacitated Minimum Spanning Tree Problem. - Jun Han 006; Graham McMahon; Stephen Sugden (LCN, 2003)