Abstract.
This is a summary of the most important results presented in the author’s PhD thesis (Spanjaard 2003). This thesis, written in French, was defended on 16 December 2003 and supervised by Patrice Perny. A copy is available from the author upon request. This thesis deals with the search for preferred solutions in combinatorial optimization problems (and more particularly graph problems). It aims at conciliating preference modelling and algorithmic concerns for decision aiding.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: March 2004,
MSC classification:
91B06, 90C27, 90B40, 16Y60
Rights and permissions
About this article
Cite this article
Spanjaard, O. Non-classical preference models in combinatorial problems: Models and algorithms for graphs. 4OR 2, 325–328 (2004). https://doi.org/10.1007/s10288-004-0045-7
Issue Date:
DOI: https://doi.org/10.1007/s10288-004-0045-7