@inproceedings{3aed4f70857448b8bcb2b4503f83ab3e,
title = "Computing possibly optimal solutions for multi-objective constraint optimisation with tradeoffs",
abstract = "Computing the set of optimal solutions for a multiobjective 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.",
author = "Nic Wilson and Abdul Razak and Radu Marinescu",
year = "2015",
language = "English",
series = "IJCAI International Joint Conference on Artificial Intelligence",
publisher = "International Joint Conferences on Artificial Intelligence",
pages = "815--822",
editor = "Michael Wooldridge and Qiang Yang",
booktitle = "IJCAI 2015 - Proceedings of the 24th International Joint Conference on Artificial Intelligence",
address = "United States",
note = "24th International Joint Conference on Artificial Intelligence, IJCAI 2015 ; Conference date: 25-07-2015 Through 31-07-2015",
}