Skip to Main content Skip to Navigation
Conference papers

On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems

Nawal Benabbou 1 Patrice Perny 1
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In this paper, we propose an interactive approach to determine a compromise solution in the multicriteria spanning tree problem. We assume that the Decision Maker’s preferences over spanning trees can be represented by a weighted sum of criteria but that weights are imprecisely known. In the first part of the paper, we propose a generalization of Prim’s algorithm to determine the set of possibly optimal tradeoffs. In the second part, we propose an incremental weight elicitation method to reduce the set of feasible weights so as to identify a necessary optimal tradeoff. Numerical tests are given to demonstrate the practical feasibility of the approach.
Complete list of metadatas
Contributor : Lip6 Publications <>
Submitted on : Thursday, October 8, 2015 - 11:37:19 AM
Last modification on : Thursday, March 21, 2019 - 1:04:14 PM



Nawal Benabbou, Patrice Perny. On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems. The 4th International Conference on Algorithmic Decision Theory (ADT'15), Sep 2015, Lexington, KY, United States. pp.322-337, ⟨10.1007/978-3-319-23114-3_20⟩. ⟨hal-01213322⟩



Record views