Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 815-821.
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.
@inproceedings{ijcai2015p120,
title = {Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs},
author = {Wilson, Nic and Razak, Abdul and Marinescu, Radu},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-15}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Qiang Yang and Michael Wooldridge},
pages = {815--821},
year = {2015},
month = {7},
note = {Main Track},
url = {https://ijcai.org/proceedings/2015/120},
}
TY - CPAPER TI - Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs AU - Wilson, Nic AU - Razak, Abdul AU - Marinescu, Radu T2 - Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15 PB - International Joint Conferences on Artificial Intelligence PY - 2015 SP - 815 EP - 821 UR - https://ijcai.org/proceedings/2015/120 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
