Website
http://dataportal.arc.gov.au/NCGP/API/grants/DP0666632
Funding Status
Closed
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Funded Activity Summary
Doubly Stochastic Matrices & The Hamiltonian Cycle Problem. The classical hard problem of determining whether a given graph possesses a Hamiltonian cycle contains the essential difficulty of the famous 'Travelling Salesman Problem'. A characterisation of this difficulty in terms of variability of returns (to the initial state) in a controlled stochastic process will be a significant conceptual advance with repercussions in a number of fields including optimisation and theoretical computer science. Algorithmic advances exploiting such a characterisation will significantly contribute to existing technologies for solving problems in applications ranging from logistics to cryptography. Since TSP describes certain efficient ways of routing its applicability to information networks is clear.Funded Activity Details
Start Date: 2006
End Date: 06-2011
Funding Scheme: Discovery Projects
Funding Amount: $560,000.00
Funder: Australian Research Council
Research Topics
ANZSRC Field of Research (FoR)
Stochastic Analysis And Modelling | Statistics | Optimisation | Operations Research |
