Designing minimum-cost networks that are robust and avoid obstacles
Grant number: DP160100639 | Funding period: 2016 - 2020
The goal of this project is to construct a mathematical framework for the design of minimum-cost networks that are robust and avoid obstacles. Physical networks such as those required for communication, power and transportation are vital for our society, but are costly from economic and environmental viewpoints. There is a need for mathematical optimisation tools to design minimum-cost networks that take into account practical considerations such as surviving local connectivity failures and avoiding pre-existing obstacles. These are recognised as mathematically challenging problems. Current approaches employ restrictive models that do not capture the flexibility of modern infrastructure netw..View full description
Related publications (3)
New pruning rules for the Steiner tree problem and 2-connected Steiner network problem
Marcus Brazil, Marcus Volz, Martin Zachariasen, Charl Ras, Doreen Thomas
We introduce the concepts of k-lunes and k-lune inequalities, which form the basis for new geometric pruning rules for limiting th..