Maxima of a point set

Known as: Non dominated points 
In computational geometry, a point p in a finite set of points S is said to be maximal or non-dominated if there is no other point q in S whose… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1980-2018
0102019802018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Evolutionary algorithms have been shown to be powerful for solving multiobjective optimization problems, in which nondominated… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2011
Highly Cited
2011
This paper presents a hybrid Pareto-based discrete artificial bee colony algorithm for solving the multi-objective flexible job… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Under mild conditions, it can be induced from the Karush-Kuhn-Tucker condition that the Pareto set, in the decision space, of a… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In this paper, we present an approach that extends the Particle Swarm Optimization (PSO) algorithm to handle multiobjective… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Customer choice behavior, such as “buy-up” and “buy-down”, is an important phenomenon in a wide range of revenue management… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
  • table 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy… (More)
Is this relevant?
2000
2000
Although single objective metaheuristics are widely spread and applied in many combinatorial optimisation problems, only very… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Evolutionary algorithms (EA’s) are often well-suited for optimization problems involving several, often conflicting objectives… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
In trying to solve multiobjective optimization problems, many traditional methods scalar-ize the objective vector into a single… (More)
  • figure 4
Is this relevant?
Highly Cited
1980
Highly Cited
1980
 
Is this relevant?