Sciweavers

388 search results - page 42 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
EMO
2006
Springer
182views Optimization» more  EMO 2006»
15 years 3 months ago
Multi-objective Pole Placement with Evolutionary Algorithms
Multi-Objective Evolutionary Algorithms (MOEA) have been succesfully applied to solve control problems. However, many improvements are still to be accomplished. In this paper a new...
Gustavo Sánchez, Minaya Villasana, Miguel S...
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
15 years 5 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 5 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
CCO
2001
Springer
168views Combinatorics» more  CCO 2001»
15 years 4 months ago
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
Yves Pochet
JUCS
2008
153views more  JUCS 2008»
14 years 11 months ago
Bus Network Optimization with a Time-Dependent Hybrid Algorithm
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...
Ana C. Olivera, Mariano Frutos, Jessica Andrea Car...