Graham McMahon

According to our database1, Graham McMahon authored at least 11 papers between 1975 and 2009.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
Critical Thinking and ICT Integration in a Western Australian Secondary School.
J. Educ. Technol. Soc., 2009

2004
A multiservice traffic allocation model for LEO satellite communication networks.
IEEE J. Sel. Areas Commun., 2004

2003
Class Dependent Traffic Allocation in a LEO Satellite Network.
Telecommun. Syst., 2003

A Node-oriented Branch and Bound Algorithm for the Capacitated Minimum Spanning Tree Problem.
Proceedings of the 28th Annual IEEE Conference on Local Computer Networks (LCN 2003), 2003

2002
A Simulated Annealing Approach to Communication Network Design.
J. Comb. Optim., 2002

A Branch and Bound Algorithm for Minimum Cost Network Flow Problem.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2002

A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem (Research Note).
Proceedings of the Euro-Par 2002, 2002

2000
A model for nonlinear cost problems in optimal design of communication networks.
Proceedings of the Proceedings Ninth International Conference on Computer Communications and Networks, 2000

1999
An integrated GA-LP approach to communication network design.
Telecommun. Syst., 1999

1994
Comparison of Heuristic Search Algorithms for Single Machine Scheduling Problems.
Proceedings of the Process in Evolutionary Computation, 1994

1975
On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness.
Oper. Res., 1975


  Loading...