3142 search results - page 141 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
119
click to vote
ASIAMS
2008
IEEE
15 years 9 months ago
2008
IEEE
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possibl...
151
click to vote
SAGA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...
132
click to vote
EOR
2006
15 years 3 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
129
click to vote
3DIM
2005
IEEE
15 years 9 months ago
2005
IEEE
Many optimization processes encounter a problem in efficiently reaching a global minimum or a near global minimum. Traditional methods such as Levenberg-Marquardt algorithm and t...
106
Voted
DATE
2000
IEEE
15 years 7 months ago
2000
IEEE
This paper is about gate sizing under a statistical delay model. It shows we can solve the gate sizing problem exactly for a given statistical delay model. The formulation used al...