Sciweavers

14548 search results - page 96 / 2910
» The Optimal Path-Matching Problem
Sort
View
CEC
2008
IEEE
14 years 4 months ago
A feasibility-preserving local search operator for constrained discrete optimization problems
Abstract— Meta-heuristic optimization approaches are commonly applied to many discrete optimization problems. Many of these optimization approaches are based on a local search op...
Martin Lukasiewycz, Michael Glaß, Christian ...
SIAMJO
2008
85views more  SIAMJO 2008»
13 years 10 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Igor Averbakh, Yun-Bin Zhao
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
14 years 3 months ago
Evolutionary optimization of dynamic control problems accelerated by progressive step reduction
In this paper, we describe the use of an evolutionary algorithm (EA) to solve dynamic control optimization problems in engineering. In this class of problems, a set of control var...
Q. Tuan Pham
IPPS
1999
IEEE
14 years 2 months ago
Parallel Ant Colonies for Combinatorial Optimization Problems
Abstract. Ant Colonies AC optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies...
El-Ghazali Talbi, Olivier Roux, Cyril Fonlupt, Den...
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 10 months ago
A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
Mugurel Ionut Andreica