Overview
About the project
Combinatorial optimisation problems arise in different disciplines of engineering and science. Mixed-integer linear programming problems (MILP) are solved for developing context-specific metabolic models in biotechnology and for determining operation strategies in water distribution networks in engineering. The MILP problems have to be solved periodically to find optimal solutions. However, large-scale MILP problems are difficult to solve and intractable in practice. Recently, graph neural networks (GNN) based approaches have shown potential promises in exploiting solution patterns for solving these problems.
The Graph Neural Networks for Solving Combinatorial Optimization Problems project is offered Deakin University.
Programme Structure
- This project will develop novel and efficient GNN-based approach for solving MILP problems.
Key information
Duration
- Full-time
- 48 months
Start dates & application deadlines
- Starting
- Apply before
-
Language
Delivered
Disciplines
Sustainable Development Machine Learning View 14 other PhDs in Sustainable Development in AustraliaAcademic requirements
We are not aware of any specific GRE, GMAT or GPA grading score requirements for this programme.
English requirements
We are not aware of any English requirements for this programme.
Student insurance
Make sure to cover your health, travel, and stay while studying abroad. Even global coverages can miss important items, so make sure your student insurance ticks all the following:
- Additional medical costs (i.e. dental)
- Repatriation, if something happens to you or your family
- Liability
- Home contents and baggage
- Accidents
- Legal aid
We partnered with Aon to provide you with the best affordable student insurance, for a carefree experience away from home.
Get your student insurance nowStarting from €0.53/day, free cancellation any time.
Remember, countries and universities may have specific insurance requirements. To learn more about how student insurance work at Deakin University and/or in Australia, please visit Student Insurance Portal.
Other requirements
General requirements
- academic transcripts
- curriculum vitae (CV) detailing publications, relevant professional and research experience
- evidence of English language proficiency
- statement of purpose (a written statement of your motivation)
- contact details of two academic referees.
- CRICOS Provider Code: 00113B
Tuition Fee
-
International
FreeTuition FeeBased on the tuition of 0 AUD for the full programme during 48 months. -
National
FreeTuition FeeBased on the tuition of 0 AUD for the full programme during 48 months.
All successful applicants will receive a scholarship that will cover tuition fees, a stipend and financial support.
Living costs for Geelong
The living costs include the total expenses per month, covering accommodation, public transportation, utilities (electricity, internet), books and groceries.
Funding
In order for us to give you accurate scholarship information, we ask that you please confirm a few details and create an account with us.
Scholarships Information
Below you will find PhD's scholarship opportunities for Graph Neural Networks for Solving Combinatorial Optimization Problems.
Available Scholarships
You are eligible to apply for these scholarships but a selection process will still be applied by the provider.
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility
Read more about eligibility