{"type":"ScholarlyArticle","title":"Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs","authors":[{"name":"Nic Wilson","slug":"nic-wilson","given":"Nic","family":"Wilson","affiliation":""},{"name":"Abdul Razak","slug":"abdul-razak","given":"Abdul","family":"Razak","affiliation":""},{"name":"Radu Marinescu","slug":"radu-marinescu","given":"Radu","family":"Marinescu","affiliation":""}],"abstract":"Computing the set of optimal solutions for a multi-objective constraint optimisation problem can be computationally very challenging. Also, when solutions are only partially ordered, there can be a number of different natural notions of optimality, one of the most important being the notion of Possibly Optimal, i.e., optimal in at least one scenario compatible with the inter-objective tradeoffs. We develop an AND/OR Branch-and-Bound algorithm for computing the set of Possibly Optimal solutions, and compare variants of the algorithm experimentally.","doi":null,"url":"https://ijcai.org/proceedings/2015/120","pdf":"https://ijcai.org/proceedings/2015/0120.pdf","markdown":"https://ijcai.org/proceedings/2015/120.md","bibtex":"https://ijcai.org/proceedings/2015/bibtex/120","volume":{"slug":"2015","title":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2015","url":"https://ijcai.org/proceedings/2015/","year":2015,"location":"Buenos Aires, Argentina","dates":"25–31 July 2015","editors":"Qiang Yang and Michael Wooldridge","isbn":"978-1-57735-738-4","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Heuristic Search","track":"Main Track","number":120,"pages":{"first":815,"last":821},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}