Sciweavers

1940 search results - page 46 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
MP
2008
129views more  MP 2008»
15 years 6 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
15 years 10 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...
HEURISTICS
2002
146views more  HEURISTICS 2002»
15 years 6 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
PROCEDIA
2011
14 years 9 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
EMO
2003
Springer
81views Optimization» more  EMO 2003»
15 years 11 months ago
Solving Hierarchical Optimization Problems Using MOEAs
Abstract. In this paper, we propose an approach for solving hierarchical multi-objective optimization problems (MOPs). In realistic MOPs, two main challenges have to be considered:...
Christian Haubelt, Sanaz Mostaghim, Jürgen Te...