Sciweavers

5331 search results - page 120 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
EOR
2006
130views more  EOR 2006»
14 years 10 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
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...
Roberto Montemanni
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
15 years 1 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
14 years 11 months ago
Solving constrained multi-objective problems by objective space analysis
In this paper a new approach to solve constrained multi-objective problems by way of evolutionary multi-objective optimization is introduced. In contrast to former evolutionary ap...
Gideon Avigad, Carlos A. Coello Coello
INFORMATICALT
2010
101views more  INFORMATICALT 2010»
14 years 8 months ago
An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...
Chen-Sung Chang
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 1 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa