Geoff is an Associate Fellow of the Institute of Mathematics and its Applications. IEEE Computer Society Affiliate
He has been a consultant and author for the Open University.
Geoff has a B.Sc. in Mathematics, an M.Sc. in Numerical Analysis and Computing and a Ph.D. in Numerical Analysis, all from Victoria University of Manchester.
Construction of factory schedules using reverse simulation,
in European Journal of Operational Research
pp. 656-676Full Text UEA Repository
A PROBE-Based Heuristic for Graph Partitioning,
in IEEE Transactions on Computers
pp. 1701-1720Full Text UEA Repository
Solving a Time-Space Network Formulation for the Convoy Movement Problem,
in Operations Research
pp. 219-230Full Text UEA Repository
PROBE: a Metaheuristic for Hybridization,Full Text UEA Repository
Hybridizing GRASP, PROBE and Path Relinking,Full Text UEA Repository
A New Metric for Categorical Data,
in Statistical Data Mining and Knowledge Discovery.
ISBN 978-1-58488-344-9Full Text UEA Repository
The PROBE Metaheuristic and its Application to the Multiconstraint Knapsack Problem,
in METAHEURISTICS: Computer Decision-Making.
Kluwer Academic Publishers
ISBN 978-1-4020-7653-4Full Text UEA Repository
Distribution, Cooperation and Hybridisation for Combinatorial Optimization,
in Optimization Software Class Libraries.
ISBN 978-1-4020-7002-0Full Text UEA Repository
Application of GRASP to the multiconstraint knapsack problem,
in Applications of Evolutionary Computing.
ISBN 978-3-540-41920-4Full Text UEA Repository
Mathematical Foundations for Computing,
ISBN 9780333488553UEA Repository
Parallel Branch and Bound,
in Advances in Parallel Algorithms.
ISBN 0-470-21907-6UEA Repository
The General Problem-Solving Algorithm and its Implementation,
in New Generation Computing
pp. 41-66Full Text UEA Repository
Mathematics for Computing,
ISBN 978-0333291702UEA Repository
Key Research Interests
Geoffrey Mckoewn is part of the Machine Learning and Statistics group
Combinatorial and Numerical Algorithms:
parallel algorithms - including systolic arrays numerical linear algebra algorithm abstraction branch-and-bound paradigm - including parallel implementation linear and integer linear programming (LP and IP).
Use of functional programming languages for the specification and transformation of algorithms for mathematical computation Haskell as a language for systolic design.
Past Research Projects and Grants
Using simulated annealing to solve large scale scheduling problems (Phase 4)
Using simulated annealing to solve large scale scheduling problems
- Library liaison
- Director of Learning and Teaching