资源分类
》 资源 》论文》Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs

Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs

2019-11-18 | |  75 |   48 |   0
Abstract Computing the set of optimal solutions for a multiobjective 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.

上一篇：Mining Expert Play to Guide Monte Carlo Search in the Opening Moves of Go

下一篇：AskWorld: Budget-Sensitive Query Evaluation for Knowledge-on-Demand

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...