Skip to search formSkip to main contentSkip to account menu

Ordinal optimization

In mathematical optimization, ordinal optimization is the maximization of functions taking values in a partially ordered set ("poset"). Ordinal… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
This paper describes and analyzes the problem of selecting the best of several alternatives (“systems”), where they are compared… 
Highly Cited
2010
Highly Cited
2010
We consider how local and global decision policies interact in stopping time problems such as quickest time change detection… 
Highly Cited
2007
Highly Cited
2007
The increasing complexity of the transmission expansion planning problem in the restructured industry makes simulation the only… 
Highly Cited
2006
Highly Cited
2006
Ordinal optimization has emerged as an efficient technique for simulation optimization. A good allocation of simulation samples… 
Highly Cited
2004
Highly Cited
2004
The optimal power flow (OPF) problem with discrete control variables is an NP-hard problem in its exact formulation. To cope with… 
Highly Cited
2001
Highly Cited
2001
The deregulation and reconstruction of the electric power industry worldwide raises many challenging issues related to the… 
Highly Cited
1999
Highly Cited
1999
The performance of heuristic algorithms for combinatorial optimization is often sensitive to problem instances. In extreme cases… 
1998
1998
A general approach for coordinating the legs of a multi-legged statically stable walking machine on an uneven terrain. The method… 
Highly Cited
1997
Highly Cited
1997
We examine in this paper the subset selection procedure in the context of ordinal optimization introduced in Ref. 1. Major… 
1994
1994
The authors study the voice-call admission control problem in integrated voice/data multihop radio networks. They develop an…