Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs
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.
Cite
Text
Wilson et al. "Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs." International Joint Conference on Artificial Intelligence, 2015.Markdown
[Wilson et al. "Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs." International Joint Conference on Artificial Intelligence, 2015.](https://mlanthology.org/ijcai/2015/wilson2015ijcai-computing/)BibTeX
@inproceedings{wilson2015ijcai-computing,
title = {{Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs}},
author = {Wilson, Nic and Razak, Abdul and Marinescu, Radu},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2015},
pages = {815-822},
url = {https://mlanthology.org/ijcai/2015/wilson2015ijcai-computing/}
}