Understanding the empirical hardness of random optimisation problems

McCreesh, C. , Pettersson, W. and Prosser, P. (2019) Understanding the empirical hardness of random optimisation problems. Lecture Notes in Computer Science, (Accepted for Publication)

McCreesh, C. , Pettersson, W. and Prosser, P. (2019) Understanding the empirical hardness of random optimisation problems. Lecture Notes in Computer Science, (Accepted for Publication)

[img] Text
190408.pdf - Accepted Version
Restricted to Repository staff only

1MB

Abstract

No abstract available.

Item Type:Articles
Status:Accepted for Publication
Refereed:Yes
Glasgow Author(s) Enlighten ID:Pettersson, Dr William and Mccreesh, Dr Ciaran and Prosser, Dr Patrick
Authors: McCreesh, C., Pettersson, W., and Prosser, P.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science
Publisher:Springer
ISSN:0302-9743
ISSN (Online):0302-9743

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

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
3005250Modelling and Optimisation with GraphsPatrick ProsserEngineering and Physical Sciences Research Council (EPSRC)EP/P026842/1Computing Science
3008080IP-MATCH: Integer Programming for Large and Complex Matching ProblemsDavid ManloveEngineering and Physical Sciences Research Council (EPSRC)EP/P028306/1Computing Science