Skip to main content

Outer Branching: How to Optimize under Partial Orders?

  • Conference paper
Multiobjective Programming and Goal Programming

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 618))

  • 2052 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Boutilier C, Brafman R, Domshlak C, Hoos H, Poole D (2004) Preference-based constrained optimization with CP-Nets. Comput Intell 20:137–157

    Article  Google Scholar 

  2. Chankong V, Haimes Y (1983) Multiobjective decision making theory and methodology. Elsevier, New York

    Google Scholar 

  3. Ehrgott M (1997) A characterization of lexicographic max-ordering solutions. In: Methods of multicriteria decision theory. Proceedings of the 6th Workshop of the DGOR Working-Group Multicriteria Optimization and Decision Theory, Häsel-Hohenhausen, Egelsbach, pp 193–202

    Google Scholar 

  4. Ehrgott M, Gandibleux X (2000) A survey and annoted bibliography of multiobjective combinatorial optimization. OR Spektrum 22:425–460

    Google Scholar 

  5. Ehrgott M, Ruzika S (2005) An improved epsilon-constraint method for multiobjective programming. Technical report, University of Kaiserslautern, Germany

    Google Scholar 

  6. Gavanelli M (2002) An algorithm for multi-criteria optimization in CSPs. In: Proceedings of ECAI'02, IOS , Lyon, France, pp 136–140

    Google Scholar 

  7. Junker U (2004) Preference-based search and multi-criteria optimization. Ann Oper Res 130:75–115

    Article  Google Scholar 

  8. Junker U (2005) Preference-based inconsistency proving: When the failure of the best is sufficient. In: Proceedings of IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling, pp 106–111

    Google Scholar 

  9. Junker U, Mailharro D (2003) Preference programming: advanced problem solving for configuration. AI-EDAM 17:13–29

    Google Scholar 

  10. Laumanns M, Thiele L, Zitzler E (2005) An adaptive scheme to generate the pareto front based on the epsilon-constraint method. In: Branke J, Deb K, Miettinen K, Steuer R (eds) Practical approaches to multi-objective optimization. Dagstuhl Seminar Proceedings 04461

    Google Scholar 

  11. Srinivasan V, Thompson G (1976) Algorithms for minimizing total cost, bottleneck time, and bottleneck shipment in transportation problems. Naval Res Logist Quart 23:567–598

    Article  Google Scholar 

  12. Steuer R (1986) Multi criteria optimization: theory, computation, and application. Wiley, New York

    Google Scholar 

  13. Van Wassenhove L, Gelders L (1980) Solving a bicriterion scheduling problem. Eur J Oper Res 4(1):42–48

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ulrich, J. (2009). Outer Branching: How to Optimize under Partial Orders?. In: Barichard, V., Ehrgott, M., Gandibleux, X., T'Kindt, V. (eds) Multiobjective Programming and Goal Programming. Lecture Notes in Economics and Mathematical Systems, vol 618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85646-7_10

Download citation

Publish with us

Policies and ethics