Name: Prof. Mark Wallace

Title: Deputy Dean (Research), Faculty of Information Technology

Affiliation: Monash University

Mark’s research interests lie in modelling and software platforms for planning, scheduling and optimisation problems. His area of special interest is in the combination of methods from different research areas including mathematical programming, artificial intelligence and metaheuristics. He is a founder of the international Constraint Programming (CP) community, and has been a developer of a sequence CP platforms, deployed commercially and widely used in academia. He founded the Monash/NICTA spin-off company Opturion, commercialising 60 person-years of research at these organisations. His publications, including two books, are widely cited, and he has given keynotes at many international conferences. His focus both in industry and University has been on application-driven research and development, where industry funding is essential both to ensure research impact and to support sufficient research effort to build software systems that are robust enough for application developers to actually use.

MA,BA (Maths and Philosophy),  Oxford University 1977

MSc (Comp.Sci.), QMC, London University 1980

PhD (Comp.Sci.), The University of Southampton 1983

Research Centre Director,  CTI-Monash Centre for Optimisation in Travel, Transport and Logistics. Faculty of Information Technology, Monash University

Fellow National ICT Australia (NICTA)

Major funding for application-driven research (ARC Linkage grants) supports Mark’s research on resource scheduling and optimisation.

Books

  1. Apt, K., & Wallace, M. (2007). Constraint Logic Programming using ECLiPSe. Cambridge, UK: Cambridge University Press.
  1. Wallace, M. (1984). Communicating with Databases in Natural Language. Chichester, England: Ellis Horwood.

 

Journal Articles

  1. Bampo, M., Ewing, M., Mather, D., Stewart, D., & Wallace, M. (2008). ‘The effects of the social structure of digital networks on viral marketing performance’. Information Systems Research, 19(3), 273-290.
  2. Wallace, M., Schimpf, J., Shen, K., & Harvey, W. (2004). ‘On benchmarking constraint logic programming platforms’. Constraints, 9(1), 5-34.
  3. El Sakkout, H., & Wallace, M. (2000). ‘Probe backtrack search for minimal perturbation in dynamic scheduling’. Constraints, 5(4), 359-388.
  4. Wallace, J. Schimpf. (2002). ‘Finding the right hybrid algorithm–A combinatorial meta-problem’. Annals of Mathematics and Artificial Intelligence 34(4), 259-269
  5. Rodosek, R., Wallace, M., & Hajian, M. T. (1999). ‘A new approach to integrating mixed integer programming and constraint logic programming’. Annals of Operations Research, 86, 63-87.
  6. Wallace, M. (2002). ‘Constraint logic programming’. Essays in honour of Robert M. Kowalski, LNCS 2407, 139-168.
  7. Le Provost, T., & Wallace, M. (1993). ‘Generalized constraint propagation over the CLP scheme’. The Journal of Logic Programming, 16(3-4), 319-359.
  8. Wallace, M. (1993). ‘Tight, consistent, and computable completions for unrestricted logic programs’. The Journal of Logic Programming, 15(3), 243-273.

 

Conference Papers

  1. Eremin, A., & Wallace, M. (2001). ‘Hybrid benders decomposition algorithms in constraint logic programming’. In T. Walsh (Ed.), Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming (CP2001). Paphos, Cyprus, 25 November – 1 December. Published as Lecture Notes in Computer Science, 2239, 1-15.

Monash University, Faculty of Information Technology

http://www.infotech.monash.edu.au/research/profiles/profile.html?sid=6174&pid=3842