Outputs (4)

Exploring the landscape of the space of heuristics for local search in SAT (2017)
Presentation / Conference Contribution
Burnett, A. W., & Parkes, A. J. Exploring the landscape of the space of heuristics for local search in SAT. Presented at IEEE Congress on Evolutionary Computation 2017

Local search is a powerful technique on many combinatorial optimisation problems. However, the effectiveness of local search methods will often depend strongly on the details of the heuristics used within them. There are many potential heuristics, an... Read More about Exploring the landscape of the space of heuristics for local search in SAT.

International Portfolio Optimisation with Integrated Currency Overlay Costs and Constraints (2017)
Journal Article
Chatsanga, N., & Parkes, A. J. (2017). International Portfolio Optimisation with Integrated Currency Overlay Costs and Constraints. Expert Systems with Applications, 83, 333-349. https://doi.org/10.1016/j.eswa.2017.04.009

International financial portfolios can be exposed to substantial risk from variations of the exchange rates between the countries in which they hold investments. Nonetheless, foreign exchange can both generate extra return as well as loss to a portfo... Read More about International Portfolio Optimisation with Integrated Currency Overlay Costs and Constraints.

Fairness in examination timetabling: student preferences and extended formulations (2017)
Journal Article
Muklason, A., Parkes, A. J., Özcan, E., McCollum, B., & McMullan, P. (2017). Fairness in examination timetabling: student preferences and extended formulations. Applied Soft Computing, 55, 302-318. https://doi.org/10.1016/j.asoc.2017.01.026

Variations of the examination timetabling problem have been investigated by the research community for more than two decades. The common characteristic between all problems is the fact that the definitions and data sets used all originate from actual... Read More about Fairness in examination timetabling: student preferences and extended formulations.

Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem (2017)
Journal Article
Karapetyan, D., Punnen, A., & Parkes, A. J. (2017). Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem. European Journal of Operational Research, 260(2), 494-506. https://doi.org/10.1016/j.ejor.2017.01.001

We study the Bipartite Boolean Quadratic Programming Problem (BBQP) which is an extension of the well known Boolean Quadratic Programming Problem (BQP). Applications of the BBQP include mining discrete patterns from binary data, approximating matrice... Read More about Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem.