Outer Branching: How to Optimize under Partial Orders?

Junker Ulrich ()
Additional contact information
Junker Ulrich: ILOG 1681

A chapter in Multiobjective Programming and Goal Programming, 2009, pp 99-109 from Springer

Abstract: Abstract Partial orders provide a convenient way to express preferences on multiple criteria. Prominent examples are Pareto-dominance and the preference relations of (T)CP-nets [1]. In advanced personalized recommender systems, the user may also specify a partial order over the possible values of a single criterion. We introduce a technique called outer branching to compute the non-dominated frontier of optimization problems with partial orders. It can be used to compute all Pareto-optimal solutions for n criteria by performing a systematic search over the criteria space. Dominance constraints avoid the generation of non-optimal solutions.

Keywords: Constraint programming; Pareto optimization; Preference handling (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-540-85646-7_10

Ordering information: This item can be ordered from
http://www.springer.com/9783540856467

DOI: 10.1007/978-3-540-85646-7_10

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().