Show simple item record

Files in this item


Item metadata

dc.contributor.authorKuster Filipe Bowles, Juliana
dc.contributor.authorCaminati, Marco Bright
dc.contributor.editorAhrendt, Wolfgang
dc.contributor.editorTapia Tarifa, Silvia Lizeth
dc.identifier.citationKuster Filipe Bowles , J & Caminati , M B 2019 , An integrated approach to a combinatorial optimisation problem . in W Ahrendt & S L Tapia Tarifa (eds) , Integrated Formal Methods : 15th International Conference, IFM 2019, Bergen, Norway, December 2–6, 2019, Proceedings . LNCS edn , Lecture Notes in Computer Science (Programming and Software Engineering) , vol. 11918 , Springer , Cham , pp. 284-302 , 15th International Conference on integrated Formal Methods (iFM 2019) , Bergen , Norway , 2/12/19 .
dc.identifier.otherORCID: /0000-0002-5918-9114/work/65702371
dc.identifier.otherORCID: /0000-0002-4529-5442/work/68281662
dc.descriptionFunding: MRC grant MR/S003819/1 and Health Data Research UK, an initiative funded by UK Research and Innovation, Department of Health and Social Care (England) and the devolved administrations, and leading medical research charities.en
dc.description.abstractWe take inspiration from a problem from the healthcare domain, where patients with several chronic conditions follow different guidelines designed for the individual conditions, and where the aim is to find the best treatment plan for a patient that avoids adverse drug reactions, respects patient’s preferences and prioritises drug efficacy. Each chronic condition guideline can be abstractly described by a directed graph, where each node indicates a treatment step (e.g., a choice in medications or resources) and has a certain duration. The search for the best treatment path is seen as a combinatorial optimisation problem and we show how to select a path across the graphs constrained by a notion of resource compatibility. This notion takes into account interactions between any finite number of resources, and makes it possible to express non-monotonic interactions. Our formalisation also introduces a discrete temporal metric, so as to consider only simultaneous nodes in the optimisation process. We express the formal problem as an SMT problem and provide a correctness proof of the SMT code by exploiting the interplay between SMT solvers and the proof assistant Isabelle/HOL. The problem we consider combines aspects of optimal graph execution and resource allocation, showing how an SMT solver can be an alternative to other approaches which are well-researched in the corresponding domains.
dc.relation.ispartofIntegrated Formal Methodsen
dc.relation.ispartofseriesLecture Notes in Computer Science (Programming and Software Engineering)en
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectRM Therapeutics. Pharmacologyen
dc.titleAn integrated approach to a combinatorial optimisation problemen
dc.typeConference itemen
dc.contributor.sponsorMedical Research Councilen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen

This item appears in the following Collection(s)

Show simple item record