Effective profiling of large scale combinatorial optimisation problems

Research

Project Description

Finding optimum solutions to problems is one of the most common challenges in planning. It pervades all aspects of our social, environmental and economic life. However, designing programs that can solve optimisation problems effectively requires an iterative process that is often extremely challenging, time consuming and costly. For large-scale problems, this process can become impractical. This project will investigate methods to profile and understand program performance. The results will help users to design scalable, efficient optimisation programs. This will in turn allow organisations large and small to reap the benefits of optimisation technology and, thus, make more efficient use of their resources.
StatusFinished
Effective start/end date27/11/1431/12/17

Funding

  • Australian Research Council (ARC): AUD490,000.00
  • Australian Research Council (ARC)
  • Australian Research Council (ARC)