A parallel approach to bi-objective integer programming

Pettersson, W. and Ozlen, M. (2017) A parallel approach to bi-objective integer programming. ANZIAM Journal, 58, C69-C81. (doi: 10.21914/anziamj.v58i0.11724)

Full text not currently available from Enlighten.


The real world applications of optimisation algorithms often are only interested in the running time of an algorithm, which can frequently be significantly reduced through parallelisation. We present two methods of parallelising the recursive algorithm presented by Ozlen, Burton and MacRae [J. Optimization Theory and Applications; 160:470--482, 2014]. Both new methods utilise two threads and improve running times. One of the new methods, the Meeting algorithm, halves running time to achieve near-perfect parallelisation, allowing users to solve bi-objective integer problems with more variables.

Item Type:Articles
Additional Information:Proceedings of the 18th Biennial Computational Techniques and Applications Conference, Melbourne Australia, 27-30 Nov 2016.
Glasgow Author(s) Enlighten ID:Pettersson, Dr William
Authors: Pettersson, W., and Ozlen, M.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:ANZIAM Journal
Publisher:Australian Mathematical Society
ISSN (Online):1446-8735

University Staff: Request a correction | Enlighten Editors: Update this record