Potential honours, MSc and PhD students: Consult my current research activities for inspiration regarding possible research projects under my supervision. It might also be useful for you to have a quick look at my pet projects.
I am in desparate need for good students with solid education and expertise in IT/SE/CS. I shall be perfectly happy with joint supervision arrangements with colleagues in other departments. The thing is that there are plenty of exciting opportunities in developing on OR/MS modules for educational and commercial use.
One of the major challenges is the development of a user-friendly general purpose DP module. I have concrete ideas as to how this can be done. This project can be suitable for MSc/PhD students with proper IT/SE/CS background and expertise. The DP expertise can be gained on the job.
Since I joinded the University of Melbourne in 1989 I have supervised the following research dissertations:
- Dynamic programming algorithms for nonseparable objective functions (Alleli Domingo, MSc, 1992).
- A common scheme for dynamic programming and branch and bound (Emmanuel Macalalag, PhD, 1995).
- Methodological, theoretical and computational aspects of composite concave programming (Sue Findlay, MSc, 1994).
- Sensitivity Analysis for Sequential Decision Processes (Susanne Irvine, PhD, 1997).
- Algorithmic aspects of composite concave programming (Leonid Churilov, PhD, 1998).
- A classification of dynamic programming models (Gavin Cole, PhD, 2002).
- Mathematical programs with complemementarity constraints and game theory models in Electricity markets* (Hu, Xinmin, 2003)
*Danny Ralph was the (external) Academic Supervisor.
I have also supervised many honours students on the following topics:
- Multiobjective dynamic programming
- Generalized dynamic programming
- Nonserial dynamic programming
- Composite concave programming
- Stochastic dynamic programming
- Classification schemes for dynamic programming problems
- Composite linear programming
- A c-programming perspective on dc programming
- On the relationship between dynamic programming and constraint programming and branch and bound
Disclaimer: This page, its contents and style, are the responsibility of the author (Moshe Sniedovich) and do not represent the views, policies or opinions of The University of Melbourne.